On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on \(B_1\)- and \(B_2\)-branches
From MaRDI portal
Publication:266812
DOI10.1016/j.dam.2015.10.010zbMath1333.05088arXiv1501.05752OpenAlexW2962752362MaRDI QIDQ266812
Publication date: 7 April 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.05752
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (20)
Solution to a conjecture on the maximum ABC index of graphs with given chromatic number ⋮ More ordering on the difference between atom-bond connectivity index and Randić index of binary trees ⋮ Maximum atom-bond connectivity index with given graph parameters ⋮ The evolution of the structure of ABC-minimal trees ⋮ The minimal-ABC trees with \(B_2\)-branches ⋮ Complete characterization of the minimal-ABC trees ⋮ Some forbidden combinations of branches in minimal-ABC trees ⋮ Computing topological indices of the line graphs of Banana tree graph and Firecracker graph ⋮ Maximum and minimum values of inverse degree and forgotten indices on the class of all unicyclic graphs ⋮ The ABC Index Conundrum's Complete Solution ⋮ Unnamed Item ⋮ 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 ⋮ The maximum atom-bond connectivity index for graphs with edge-connectivity one ⋮ A solution of the conjecture about big vertices of minimal-ABC trees ⋮ On the minimal ABC index of trees with \(k\) leaves ⋮ Remarks on maximum atom-bond connectivity index with given graph parameters ⋮ Computer search for large trees with minimal \(\mathrm{ABC}\) index ⋮ Atom–bond connectivity index of graphs: a review over extremal results and bounds
Cites Work
- Efficient computation of trees with minimal atom-bond connectivity index
- Some upper bounds for the atom-bond connectivity index of graphs
- Further results on atom-bond connectivity index of trees
- On atom-bond connectivity index of connected graphs
- Atom-bond connectivity index of graphs
- Extremal trees with given degree sequence for the Randić index
- Atom-bond connectivity index of trees
- The atom-bond connectivity index of chemical bicyclic graphs
- The atom-bond connectivity index of catacondensed polyomino 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
- Extremal trees with fixed degree sequence for atom-bond connectivity index
- On atom-bond connectivity index
- The ABC index conundrum
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on \(B_1\)- and \(B_2\)-branches