In this work we perform computational and analytical studies of the Randić index R(G) in Erdös-Rényi models G(n, p) characterized by n vertices connected independently with probability p ∈ (0, 1). First, from a detailed scaling analysis, we show that R(G) = R(G) /(n/2) scales with the product ξ ≈ np, so we can define three regimes: a regime of mostly isolated vertices when ξ < 0.01 (R(G) ≈ 0), a transition regime for 0.01 < ξ < 10 (where 0 < R(G) < n/2), and a regime of almost complete graphs for ξ > 10 (R(G) ≈ n/2). Then, motivated by the scaling of R(G) , we analytically (i) obtain new relations connecting R(G) with other topological indices and characterize graphs which are extremal with respect to the relations obtained and (ii) apply these results in order to obtain inequalities on R(G) for graphs in Erdös-Rényi models.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.