New Bounds for the Randić Index of Graphs

The Randic index of a graph is defined as the sum of weights over all edges of , where and are the degrees of the vertices and in , respectively. In this paper, we will obtain lower and upper bounds for the Randic index in terms of size, maximum degree, and minimum degree. Moreover, we obtain a generally lower and a general upper bound for the Randic index.