Extremal trees with fixed degree sequence for atom-bond connectivity index

By Rundan Xing, Bo Zhou. 2012

51 citations recorded by the source corpus.

The atom-bond connectivity (ABC) index of a graph G is the sum of √ d(u)+d(v)−2 d(u)d(v) over all edges uv ofG, whered(u) is the degree of vertexuinG. We characterize the extremal trees withfixed degree sequence that maximize and minimize the ABC index, respectively. We also provide algorithms to construct such trees.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Physiology

View Paper: https://www.semanticscholar.org/paper/5cf6a3203a8948c388f10b83cd457106574c8d6f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Boris Furtula
2. Ivan Gutman
3. Bo Zhou
4. K. C. Das
5. Ernesto Estrada
6. Ali Ahmad
7. Gopalapillai Indulal
8. A. Güngör

In Geometry and Topology

1. Boris Furtula
2. Ivan Gutman
3. Bo Zhou
4. K. C. Das
5. Ernesto Estrada
6. Aleksandar Ilić
7. Ali Ahmad
8. Michael S. Cavers

In Physiology

1. Ivan Gutman

Citations in the corpus

• The ABC Index Conundrum (2013, background): “/ Filomat 27:6 (2013), 1075–1083 1076 In the last few years there is an increased interest for the mathematical properties of the ABC index, resulting in quite a few published papers [1, 2, 4–10, 15–19, 21, 22, 25, 26, 29–32, 34].”