Sharp Bounds for the General Randic Index of \(R\)-Graph Products

Abstract

A chemical structure specifies the molecular geometry of a given molecule or solid in the form of atom arrangements. One way to analyze its properties is to simulate its formation as a product of two or more simpler graphs. In this article, we take this idea to find upper and lower bounds for the generalized Randić index \(\mathcal{R}_{\alpha}\) of four types of graph products, using combinatorial inequalities. We finish this paper by providing the bounds for \(\mathcal{R}_{\alpha}\) of a line graph and rooted product of graphs.