A sharp lower bound of the Randić index of cacti with \(r\) pendants

DOI10.1016/j.dam.2007.08.031zbMath1152.05320OpenAlexW1988617840MaRDI QIDQ944725

Rong Luo, Xiaoya Zha, Anhua Lin

Publication date: 10 September 2008

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

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

zbMATH Keywords

lower boundRandić indexcactuschemical graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (7)

Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications ⋮ On the general sum-connectivity index and general Randić index of cacti ⋮ On a conjecture for the signless Laplacian spectral radius of cacti with given matching number ⋮ On the sum-connectivity index of cacti ⋮ Zeroth-order general Randić index of cactus graphs ⋮ Multiplicative Zagreb indices of cacti ⋮ Unnamed Item

Cites Work

• Maximum Randić index on trees with \(k\)-pendant vertices
• Maximal value of the zeroth-order Randić index
• A linear-programming approach to the generalized Randić index
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A sharp lower bound of the Randić index of cacti with \(r\) pendants