Additional Information
| Author(s) | Ashrafi A. R., Diudea M. V., Ghorbani M., Hosseinzadeh M. A. |
|---|
Modified eccentric connectivity polynomial of some graph operations
M. Ghorbani ♦ M. A. Hosseinzadeh ♦ M. V. Diudea ♦ A. R. Ashrafi
Abstract
carpathian_2012_28_2_247_256_abstractThe modified eccentricity connectivity polynomial of a connected graph G is defined as Ξ(G; x) = X u∈V (G) dG(u)x ε 0 G(u) , where ε 0 G(u) = P v∈NG(u) εG(v) and dG(u) is the degree of u in G. In this paper modified eccentric connectivity polynomial is computed for several classes of composite graphs.
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration