On structural properties of trees with minimal atom-bond connectivity index

DOI10.1016/j.dam.2014.03.009zbMath1288.05042arXiv1401.0279OpenAlexW2964252141MaRDI QIDQ2449124

Darko Dimitrov

Publication date: 6 May 2014

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

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

zbMATH Keywords

extremal graphstopological indicesatom-bond connectivity index

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Connectivity (05C40)

Related Items (25)

On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on \(B_1\)- and \(B_2\)-branches ⋮ 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 ⋮ 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 ⋮ The minimum ABC index of chemical trees ⋮ The ABC Index Conundrum's Complete Solution ⋮ On the ABC index of connected graphs with given degree sequences ⋮ On extremality of ABC spectral radius of a tree ⋮ 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 ⋮ Which tree has the smallest ABC index among trees with \(k\) leaves? ⋮ 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 ⋮ Atom-bond connectivity index of quasi-tree graphs ⋮ Remarks on maximum atom-bond connectivity index with given graph parameters ⋮ On a family of trees with minimal atom-bond connectivity index ⋮ 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
• A history of graph entropy measures
• 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 structure-sensitivity of degree-based topological indices
• 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

This page was built for publication: On structural properties of trees with minimal atom-bond connectivity index