On structural properties of trees with minimal atom-bond connectivity index
From MaRDI portal
Publication:2449124
Abstract: The {em atom-bond connectivity (ABC) index} is a degree-based molecular descriptor, that found chemical applications. It is well known that among all connected graphs, the graphs with minimal ABC index are trees. A complete characterization of trees with minimal index is still an open problem. In this paper, we present new structural properties of trees with minimal ABC index. Our main results reveal that trees with minimal ABC index do not contain so-called {em -branches}, with , and that they do not have more than four -branches.
Recommendations
- On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on B₁- and B₂-branches
- The minimal-ABC trees with \(B_2\)-branches
- On structural properties of trees with minimal atom-bond connectivity index. III: Trees with pendent paths of length three
- Notes on trees with minimal atom-bond connectivity index
- Further properties of trees with minimal atom-bond connectivity index
Cites work
- A history of graph entropy measures
- Atom-bond connectivity index of graphs
- Atom-bond connectivity index of trees
- Computer search for trees with minimal ABC index
- Efficient computation of trees with minimal atom-bond connectivity index
- Extremal trees with fixed degree sequence for atom-bond connectivity index
- Extremal trees with given degree sequence for the Randić index
- Extreme atom-bond connectivity index of graphs
- Further results on atom-bond connectivity index of trees
- scientific article; zbMATH DE number 6704583 (Why is no real title available?)
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- scientific article; zbMATH DE number 6274855 (Why is no real title available?)
- Notes on trees with minimal atom-bond connectivity index
- On atom-bond connectivity index
- On atom-bond connectivity index of connected graphs
- On extremal properties of graph entropies
- On large trees with minimal atom-bond connectivity index
- On structure-sensitivity of degree-based topological indices
- Proving a conjecture of Gutman concerning trees with minimal ABC index
- Some inequalities for the atom-Bond connectivity index of graph operations
- Some results on atom-bond connectivity index of graphs
- Some upper bounds for the atom-bond connectivity index of graphs
- The ABC index conundrum
- The ABC index of trees with given degree sequence
- The atom-bond connectivity index of benzenoid systems and phenylenes
- The atom-bond connectivity index of catacondensed polyomino graphs
- The atom-bond connectivity index of chemical bicyclic graphs
- Trees with smallest atom-bond connectivity index
Cited in
(32)- Solution to a conjecture on the maximum ABC index of graphs with given chromatic number
- The extremal graphs of some topological indices with given vertex \(k\)-partiteness
- Some forbidden combinations of branches in minimal-ABC trees
- On the ABC index of connected graphs with given degree sequences
- On extremality of ABC spectral radius of a tree
- Further properties of trees with minimal atom-bond connectivity index
- On structural properties of trees with minimal atom-bond connectivity index. III: Trees with pendent paths of length three
- Remarks on the Graovac-Ghorbani index of bipartite graphs
- On structural properties of trees with minimal atom-bond connectivity index. IV: solving a conjecture about the pendent paths of length three
- On the maximum ABC index of graphs without pendent vertices
- Remarks on maximum atom-bond connectivity index with given graph parameters
- The minimal-ABC trees with \(B_2\)-branches
- A solution of the conjecture about big vertices of minimal-ABC trees
- Atom-bond connectivity index of quasi-tree graphs
- Computer search for large trees with minimal \(\mathrm{ABC}\) index
- The evolution of the structure of ABC-minimal trees
- On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on B₁- and B₂-branches
- Efficient computation of trees with minimal atom-bond connectivity index
- Notes on trees with minimal atom-bond connectivity index
- Extremal trees with fixed degree sequence for atom-bond connectivity index
- Maximum atom-bond connectivity index with given graph parameters
- Which tree has the smallest ABC index among trees with \(k\) leaves?
- The maximum atom-bond connectivity index for graphs with edge-connectivity one
- On the minimal ABC index of trees with \(k\) leaves
- scientific article; zbMATH DE number 6274855 (Why is no real title available?)
- Atom–bond connectivity index of graphs: a review over extremal results and bounds
- Maximum Atom-Bond Sum-Connectivity Index of n-Order Trees With Fixed Number of Leaves
- On a family of trees with minimal atom-bond connectivity index
- Complete characterization of the minimal-ABC trees
- The minimum ABC index of chemical trees
- The ABC Index Conundrum's Complete Solution
- On the maximum ABC spectral radius of connected graphs with given maximum degree
This page was built for publication: On structural properties of trees with minimal atom-bond connectivity index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449124)