The structure of ABC-minimal trees with given number of leaves

From MaRDI portal



Abstract: The atom-bond connectivity (ABC) index is a degree-based molecular descriptor with diverse chemical applications. Recent work of Lin et al. [W. Lin, J. Chen, C. Ma, Y. Zhang, J. Chen, D. Zhang, and F. Jia, On trees with minimal ABC index among trees with given number of leaves, MATCH Commun. Math. Comput. Chem. 76 (2016) 131-140] gave rise to a conjecture about the minimum possible ABC-index of trees with a fixed number t of leaves. We show that this conjecture is incorrect and we prove what the correct answer is. It is shown that the extremal tree Tt is unique for tge1195, it has order |Tt|=t+lfloorfract10floor+1 (when t mod 10 is between 0 and 4 or when it is 5, 6, or 7 and t is sufficiently large) or |Tt|=t+lfloorfract10floor+2 (when t mod 10 is 8 or 9 or when it is 5, 6, or 7 and t is sufficiently small) and its ABC-index is (sqrtfrac1011+frac110sqrtfrac111)t+O(1).












This page was built for publication: The structure of ABC-minimal trees with given number of leaves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5156412)