Name
Abstract | ||
|---|---|---|
The atom-bond connectivity (ABC) index of a connected graph G is defined as ABC(G)=∑uv∈E(G)d(u)+d(v)−2d(u)d(v), where d(w) is the degree of vertex w in G and E(G) is the set of edges of G. Given greedy trees perturbed by different degree sequences, we investigate the behaviors on their ABC index in this paper. Moreover, we also give the minimum ABC index and its structural properties of the chemical trees with n vertices and p pendant vertices for n≥3p−2. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.amc.2019.124570 | Applied Mathematics and Computation |
Keywords | DocType | Volume |
Atom-bond connectivity index,Extremal graphs,Degree sequences | Journal | 362 |
ISSN | Citations | PageRank |
0096-3003 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaoxia Wu | 1 | 535 | 38.61 |
| Lianzhu Zhang | 2 | 1 | 1.37 |