Bounds on the General Eccentric Connectivity Index

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.