The extremal generalised Randić index for a given degree range

2024/02/02 by Haslegrave, John
#05C09 (Primary) 05C07 #05C35 (Secondary) #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2402.01346

Abstract

O and Shi proved that the Randić index of any graph G with minimum degree at least δ and maximum degree at most Δ is at least (√(δΔ))/(δ+Δ)|G|, with equality if and only if the graph is (δ,Δ)-biregular. In this note we give a short proof via a more general statement. We apply the latter to classify the graphs in any given degree range which minimise (or maximise) the generalised Randić index for any exponent, and describe the transitions between different types of behaviour precisely.

Related

• Sharp bounds for the Randic index of graphs with given minimum and maximum degree
• The variation of the Randic index with regard to minimum and maximum\n degree
• Lower bounds for the Randić index in terms of matching number
• Energy and Randic index of directed graphs
• Some Bounds on Zeroth-Order General Randić Index