Open AccessEccentric connectivity polynomial [ECP] of some standard graphs
Author(s) -
M. Rajeshwari,
Medha Itagi Huilgol
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1597/1/012045
Subject(s) - algorithm , computer science
Eccentric connectivity index of a graph G denoted by ξ c ( G ), can be defined as ξ c ( G ) = ∑ v ∈ V ( G ) d e g G ( v ) . e c c ( v ) here deq G ( v ) represents the vertex degree of v in G and and ecc ( v ) = max [( x , v )// x ∈ V ( G )] eccentricity of v , is the distance to a farthest vertex from v and it is denoted by ξ c ( G ). Also corresponding Eccentric connectivity polynomial [ECP] is denoted by ECP ( G , x ) is given by, E C P ( G , x ) = ∑ v ∈ V ( G ) d e g G ( v ) . x e c c v . This paper consists of Eccentric Connectivity polynomial [ECP] of some standard graphs and for some class of graphs.