Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8900970 | Applied Mathematics and Computation | 2018 | 8 Pages |
Abstract
For a graph G=(V,E), the eccentric connectivity index of G, denoted by ξc(G), is defined as ξc(G)=âvâVÉ(v)d(v), where É(v) and d(v) are the eccentricity and the degree of v in G, respectively. In this paper, we first establish the sharp lower bound for the eccentric connectivity index in terms of the order and the minimum degree of a connected G, and characterize some extremal graphs, which generalize some known results. Secondly, we characterize the extremal trees having the maximum or minimum eccentric connectivity index for trees of order n with given degree sequence. Finally, we give a sharp lower bound for the eccentric connectivity index in terms of the order and the radius of a unicyclic G, and characterize all extremal graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Yueyu Wu, Yaojun Chen,