Maximum Randić index on trees with \(k\)-pendant vertices
From MaRDI portal
Publication:1025754
DOI10.1007/s10910-006-9066-0zbMath1197.05030OpenAlexW2060412983MaRDI QIDQ1025754
Mei Lu, Feng Tian, Lian Zhu Zhang
Publication date: 23 June 2009
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-006-9066-0
Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07)
Related Items (9)
The minimum Sombor index of trees with given number of pendant vertices ⋮ Corrections of proofs for Hansen and Mélot's two theorems ⋮ The general Randić index of trees with given number of pendent vertices ⋮ A sharp lower bound of the Randić index of cacti with \(r\) pendants ⋮ A note on extremal trees with degree conditions ⋮ Randić index and eigenvalues of graphs ⋮ On the general sum-connectivity index of trees with given number of pendent vertices ⋮ The maximum Randić index of chemical trees with \(k\) pendants ⋮ Extremal trees for the general Randić index with a given domination number
Cites Work
This page was built for publication: Maximum Randić index on trees with \(k\)-pendant vertices
