Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index

DOI10.1016/j.dam.2006.11.008zbMath1120.05046MaRDI QIDQ881585

Yongtang Shi, Yumei Hu, Xue Liang Li, Tianyi Xu

Publication date: 30 May 2007

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

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

zbMATH Keywords

degree sequence; zeroth-order general Randić index; extremal \((n,m)\)-graph; molecular structure descriptor

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

Related Items

Some extremal graphs with respect to inverse degree, Entropy of weighted graphs with Randić weights, Extremality of degree-based graph entropies, Sharp bounds on the zeroth-order general Randić index of unicyclic graphs with given diameter, Sharp bounds of the zeroth-order general Randić index of bicyclic graphs with given pendent vertices, Sharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphs, Sums of powers of the degrees of graphs with \(k\) cut edges, Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs, More on ``Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index, The minimum degree distance of graphs of given order and size, Conjugated tricyclic graphs with the maximum zeroth-order general Randić index

Cites Work

• Extremal graphs for weights
• Maximal value of the zeroth-order Randić index
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item