Sharp bounds for the Randić index of graphs with given minimum and maximum degree

The Randić index of a graph G, written R(G), is the sum of 1d(u)d(v) over all edges uv in E(G). Let d and D be positive integers d