The maximum Randić index of chemical trees with \(k\) pendants

DOI10.1016/J.DISC.2009.01.021zbMath1221.05059OpenAlexW2013931903MaRDI QIDQ1043966

Wai Chee Shiu, Lian Zhu Zhang

Publication date: 10 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.01.021

zbMATH Keywords

Randić indexconnectivity indexchemical trees

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (2)

On structural properties of ABC-minimal chemical trees ⋮ Ordering chemical graphs by Randić and sum-connectivity numbers

Cites Work

• Maximum Randić index on trees with \(k\)-pendant vertices
• Corrections of proofs for Hansen and Mélot's two theorems
• Trees of extremal connectivity index
• Unnamed Item
• Unnamed Item

This page was built for publication: The maximum Randić index of chemical trees with \(k\) pendants