Complete characterization of the minimal-ABC trees

From MaRDI portal
Publication:6103484

DOI10.1016/J.DAM.2023.03.027zbMATH Open1515.05050arXiv2110.14712OpenAlexW4376631285MaRDI QIDQ6103484

Zhibin Du, Darko Dimitrov

Publication date: 5 June 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: The problem of characterizing trees with minimal atom-bond-connectivity index (minimal-ABC trees) has a reputation as one of the most demanding recent open optimization problems in mathematical chemistry. Here firstly, we give an affirmative answer to the conjecture, which states that enough large minimal-ABC trees are comprised solely of a root vertex and so-called Dz- and Dz+1-branches. Based on the presented theoretical results here and some already known results, we obtain enough constraints to reduce the search space and solve the optimization problem, and thus, determine exactly the minimal-ABC trees of a given arbitrary order.


Full work available at URL: https://arxiv.org/abs/2110.14712





Cites Work


Cited In (7)






This page was built for publication: Complete characterization of the minimal-ABC trees

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