×

Further results on atom-bond connectivity index of trees. (English) Zbl 1216.05161

Summary: The atom-bond connectivity (ABC) index of a graph \(G\) is defined as \[ \text{ABC}(G)= \sum_{uv\in E(G)} \sqrt{{d_u+ d_v- 2\over d_u d_v}}, \] where \(E(G)\) is the edge set and \(d_u\) is the degree of vertex \(u\) of \(G\). We give the best upper bound for the ABC index of trees with a perfect matching, and characterize the unique extremal tree, which is a molecular tree. We also give upper bounds for the ABC index of trees with fixed number of vertices and maximum degree, and of molecular trees with fixed numbers of vertices and pendent vertices, and characterize the extremal trees.

MSC:

05C90 Applications of graph theory
05C05 Trees
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Cvetković, D.; Gutman, I.; Trinajstić, N., Kekulé structures and topology, Chem. Phys. Lett., 16, 614-616 (1972)
[2] Estrada, E.; Torres, L.; Rodríguez, L.; Gutman, I., An atom-bond connectivity index: modelling the enthalpy of formation of alkanes, Indian J. Chem., 37A, 849-855 (1998)
[3] Estrada, E., Atom-bond connectivity and the energetic of branched alkanes, Chem. Phys. Lett., 463, 422-425 (2008)
[4] Furtula, B.; Graovac, A.; Vukičević, D., Atom-bond connectivity index of trees, Discrete Appl. Math., 157, 2828-2835 (2009) · Zbl 1209.05252
[5] Hansen, P.; Mélot, H., Variable neighborhood search for extremal graphs. 6. Analyzing bounds for the connectivity index, J. Chem. Inf. Comput. Sci., 43, 1-14 (2003)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.