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
-
An inertial method for solving the split equality fixed point problem with multiple output sets
-
Asymptotic modeling of non-linear viscopiezoelectric Kelvin-Voigt type plates via Trotter theory
-
Properties of isocompact spaces in topological groups
-
Two generalized cyclic projection algorithms for solving a class of the split feasibility problem in real Hilbert spaces
-
Global-fixed-point property of gyrogroup actions
-
On simple normal structure and best proximity points in reflexive Banach space
-
Unified Convergence Analysis of Certain At Least Fifth Order Methods
-
A set packing model for the Partition Coloring Problem
-
Cut-through connections of graphs
-
Positive solutions for multipoint boundary value problem of fractional differential equation with parameter