On Eccentric Connectivity Index and Connectivity
- 14 Downloads
Let G be a finite connected graph. The eccentric connectivity index ξc(G) of G is defined as ξc(G) = ΣV∈V (G) ec(v)deg(v), where ec(v) and deg(v) denote the eccentricity and degree of a vertex v in G, respectively. In this paper, we give an asymptotically sharp upper bound on the eccentric connectivity index in terms of order and vertex-connectivity and in terms of order and edge-connectivity. We also improve the bounds for triangle-free graphs.
KeywordsExtremal graph order diameter vertex-connectivity edge-connectivity
MR(2010) Subject Classification05C35 05C12 05C40
Unable to display preview. Download preview PDF.
- Sharma, V., Goswami, R., Madan, A. K.: Eccentric connectivity index: A novel highly discriminating topological descriptor for structure property and structure activity studies. J. Chem. Inf. Model., 37, 273–282 (1997)Google Scholar