Name
Abstract | ||
|---|---|---|
Given a graph G, the atom–bond connectivity (ABC) index is defined to be ABC(G)=∑u∼vd(u)+d(v)−2d(u)d(v) where u and v are vertices of G, d(u) denotes the degree of the vertex u, and u∼v indicates that u and v are adjacent. Although it is known that among trees of a given order n, the star has maximum ABC index, we show that if k≤18, then the star of order k+1 has minimum ABC index among trees with k leaves. If k≥19, then the balanced double star of order k+2 has the smallest ABC index. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.dam.2015.05.008 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Atom-bond connectivity index,ABC index,Tree | Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Double star,Mathematics | Journal |
Volume | ISSN | Citations |
194 | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Colton Magnant | 1 | 113 | 29.08 |
| Pouria Salehi Nowbandegani | 2 | 5 | 4.30 |
| Ivan Gutman | 3 | 917 | 134.74 |