On the minimal ABC index of trees with \(k\) leaves

DOI10.1016/j.dam.2016.10.007zbMath1358.05163OpenAlexW2547547077MaRDI QIDQ516895

Chi Ma, Dongzhan Zhang, Peixi Li, Wenshui Lin, Yuan Zhang, Jian-Feng Chen

Publication date: 15 March 2017

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

Full work available at URL: https://doi.org/10.1016/j.dam.2016.10.007

zbMATH Keywords

extremal graphsatom-bond connectivity indexpendent vertices

Mathematics Subject Classification ID

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

Related Items (4)

The minimum Sombor index of trees with given number of pendant vertices ⋮ On the maximum ABC index of graphs without pendent vertices ⋮ A note on extremal trees with degree conditions ⋮ Atom–bond connectivity index of graphs: a review over extremal results and bounds

Cites Work

• On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on \(B_1\)- and \(B_2\)-branches
• Efficient computation of trees with minimal atom-bond connectivity index
• Which tree has the smallest ABC index among trees with \(k\) leaves?
• On structural properties of trees with minimal atom-bond connectivity index. III: Trees with pendent paths of length three
• Computer search for trees with minimal ABC index
• On structural properties of trees with minimal 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

This page was built for publication: On the minimal ABC index of trees with \(k\) leaves