Complete characterization of the minimal-ABC trees
From MaRDI portal
Publication:6103484
DOI10.1016/J.DAM.2023.03.027zbMATH Open1515.05050arXiv2110.14712OpenAlexW4376631285MaRDI QIDQ6103484
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 - and -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
Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The atom-bond connectivity index of chemical bicyclic graphs
- Some inequalities for the atom-Bond connectivity index of graph operations
- Computer search for trees with minimal ABC index
- On structural properties of trees with minimal atom-bond connectivity index
- On the atom-bond connectivity index and radius of connected graphs
- On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on \(B_1\)- and \(B_2\)-branches
- Trees with smallest atom-bond connectivity index
- The ABC index of trees with given degree sequence
- The atom-bond connectivity index of benzenoid systems and phenylenes
- Some upper bounds for the atom-bond connectivity index of graphs
- The ABC index conundrum
- Further results on atom-bond connectivity index of trees
- On atom-bond connectivity index of connected graphs
- Atom-bond connectivity index of trees
- On structural properties of trees with minimal atom-bond connectivity index. III: Trees with pendent paths of length three
- The minimal-ABC trees with \(B_2\)-branches
- On atom-bond connectivity index of graphs
- On a relation between the atom-bond connectivity and the first geometric-arithmetic indices
- On a family of trees with minimal atom-bond connectivity index
- The ABC matrix
- Remarks on maximum atom-bond connectivity index with given graph parameters
- Some forbidden combinations of branches in minimal-ABC trees
- On structural properties of trees with minimal atom-bond connectivity index. IV: solving a conjecture about the pendent paths of length three
- The evolution of the structure of ABC-minimal trees
- A solution of the conjecture about big vertices of minimal-ABC trees
- Computer search for large trees with minimal \(\mathrm{ABC}\) index
Cited In (7)
- A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes
- Extremal results and bounds for atom-bond sum-connectivity index
- Bond incident degree indices of connected \((n, m)\)-graphs with fixed maximum degree
- The ABC Index Conundrum's Complete Solution
- Computer search for trees with minimal ABC index
- The minimum ABC index of chemical trees
- The evolution of the structure of ABC-minimal trees
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)