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 \(Rα\) of four types of graph products, using combinatorial inequalities. We finish this paper by providing the bounds for \(Rα\) of a line graph and rooted product of graphs.
No takes yet. Share an insight, caveat, or question.
Zhang et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: