Trees with a given order and matching number that have maximum general Randić index

DOI10.1016/j.disc.2010.04.028zbMath1205.05052OpenAlexW2014000148MaRDI QIDQ708366

Jianxi Liu, Lingping Zhong, Xue Liang Li

Publication date: 11 October 2010

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

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

zbMATH Keywords

treematchinggeneral Randić indexvertex degree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (6)

SHARP BOUNDS FOR THE GENERAL RANDIĆ INDEX OF TREES WITH GIVEN DEGREE SEQUENCES ⋮ General Randić index of trees with given number of branching vertices ⋮ Sandwiching the (generalized) Randić index ⋮ The general Randić index of trees with given number of pendent vertices ⋮ Survey on the general Randić index: extremal results and bounds ⋮ Extremal trees for the general Randić index with a given domination number

Cites Work

• Conjugated trees with minimum general Randić index
• On the Randić index of acyclic conjugated molecules
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trees with a given order and matching number that have maximum general Randić index