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
-
Stability of new functional equations and partial multipliers in Banach *-algebras
-
Characterizations of amenable gyrogroups related to Tarski's Theorem
-
Two new extragradient methods for solving pseudomonotone the equilibrium problem in Hilbert spaces
-
On the error estimates for the sequence of successive approximations for cyclic \varphi–contractions in metric spaces
-
Hybrid CG-Like Algorithm for Nonlinear Equations and Image Restoration
-
New class of n-order fractional differential equations and solvability in the double sequence space m^2(\Delta_{v}^{u}, \phi,p)
-
Constructing DNA Codes using Double Cyclic Codes of Odd and Even Lengths over F2 + u F2
-
Consequences of the product rule in Stieltjes differentiability
-
On the existence and uniqueness of fixed points in Banach spaces using the Krasnoselskij iterative method
-
A quaternionic product of simple ratios