Name
Abstract | ||
|---|---|---|
For a connected graph G, the eccentric connectivity index (ECI) and connective eccentricity index (CEI) of G are, respectively, defined as c(G)=viV(G)degG(vi)G(vi), ce(G)=viV(G)degG(vi)G(vi) where degG(vi) is the degree of vi in G and G(vi) denotes the eccentricity of vertex vi in G. In this paper we study on the difference of ECI and CEI of graphs G, denoted by D(G)=c(G)ce(G). We determine the upper and lower bounds on D(T) and the corresponding extremal trees among all trees of order n. Moreover, the extremal trees with respect to D are completely characterized among all trees with given diameter d. And we also characterize some extremal general graphs with respect to D. Finally we propose that some comparative relations between CEI and ECI are proposed on general graphs with given number of pendant vertices. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.dam.2017.08.010 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Eccentricity,Eccentric connectivity index,Connective eccentricity index,Diameter | Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Upper and lower bounds,Eccentricity (behavior),Connectivity,Topological index,Mathematics | Journal |
Volume | Issue | ISSN |
233 | C | 0166-218X |
Citations | PageRank | References |
2 | 0.42 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kexiang Xu | 1 | 72 | 11.43 |
| Yaser Alizadeh | 2 | 13 | 1.58 |
| Kinkar Ch. Das | 3 | 18 | 10.11 |