Abstract
The problem of complete characterization of trees with minimal atom-bond-connectivity index (minimal-ABC trees) is a long-standing open problem. 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
