Which tree has the smallest ABC index among trees with \(k\) leaves?
From MaRDI portal
Publication:494433
DOI10.1016/J.DAM.2015.05.008zbMath1319.05039OpenAlexW875733777MaRDI QIDQ494433
Pouria Salehi Nowbandegani, Colton Magnant, Ivan Gutman
Publication date: 1 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.008
Related Items (11)
Solution to a conjecture on the maximum ABC index of graphs with given chromatic number ⋮ Maximum atom-bond connectivity index with given graph parameters ⋮ 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 ⋮ The maximum atom-bond connectivity index for graphs with edge-connectivity one ⋮ On the minimal ABC index of trees with \(k\) leaves ⋮ A note on extremal trees with degree conditions ⋮ On structural properties of ABC-minimal chemical trees ⋮ On the ABC spectra radius of unicyclic graphs ⋮ Extremal augmented Zagreb index of trees with given numbers of vertices and leaves ⋮ Atom–bond connectivity index of graphs: a review over extremal results and bounds
Cites Work
This page was built for publication: Which tree has the smallest ABC index among trees with \(k\) leaves?
