Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/17369
 Title: Notes on trees with minimal atom-bond connectivity index Authors: Gutman, Ivan Furtula, Boris Ivanović, Miloš Journal: MATCH Communications in Mathematical and in Computer Chemistry Issue Date: 2012 Abstract: If G = (V, E) is a molecular graph, and d(u) is the degree of its vertex u, then the atom-bond connectivity index of G is $$ABC = \sum_{uv\in E} \sqrt{[d(u) + d(v) − 2]/[d(u) d(v)]}$$. This molecular structure descriptor, introduced by Estrada et al. in the late 1990s, found recently interesting applications in the study of the thermodynamic stability of acyclic saturated hydrocarbons, and the strain energy of their cyclic congeners. In connection with this, one needs to know which trees have extremal ABC-values. Whereas it is easy to demonstrate that the star has maximal ABC, characterizing the trees with minimal ABC appears to be a much more diﬃcult task. In this paper we determine a few structural features of the trees with minimal ABC, which brings us a step closer to the complete solution of the problem. URI: https://scidar.kg.ac.rs/handle/123456789/17369 Type: article ISSN: 0340-6253 Appears in Collections: Faculty of Science, Kragujevac

8