Abstract
The general eccentric connectivity index of a graph R is defined as ξec(R)=∑u∈V(G)d(u)ec(u)α, where α is any real number, ec(u) and d(u) represent the eccentricity and the degree of the vertex u in R, respectively. In this paper, some bounds on the general eccentric connectivity index are proposed in terms of graph-theoretic parameters, namely, order, radius, independence number, eccentricity, pendent vertices and cut edges. Moreover, extremal graphs are characterized by these bounds.
Funder
Anhui Province Higher School
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference22 articles.
1. Bondy, J.A., and Murty, U.S.R. (2008). Graph Theory, Springer.
2. Eccentric connectivity index: A novel highly discriminating topological descriptor for structure-property and structure-activity studies;Sharma;J. Chem. Int. Model,1997
3. On eccentric connectivity index;Zhou;Math. Commun. Math. Comput. Chem.,2010
4. On the eccentric connectivity index of a graph;Morgan;Discrete Math.,2011
5. A lower bound on the eccentric connectivity index of a graph;Morgan;Discrete Appl. Math.,2012
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献