A lower bound of the general Randić index of chemical graphs (Q2853194)

A chemical graph is a graph in which no vertex has a degree greater than four. For a graph \(G=(V,E)\) and \(\alpha\), an arbitrary real number, the general Randić index \(R_\alpha(G)\) of \(G\), is the sum of \((d(u)d(v))^\alpha\) over all edges \(uv\) of \(G\), where \(d(u)\) denotes the degree of a vertex \(u\).NEWLINENEWLINE The structures of extremal chemical trees with the minimum general Randić index and the structure of chemical graphs with minimum general Randić index for \(-1<\alpha<0\), are characterized.