The Randić index of a graph G, denoted by R(G), is defined as the sum of 1/ √ d(u)d(v) over all edges uv of G, where d(u) denotes the degree of a vertex u in G. In this paper, we partially solve two conjectures on the Randić index R(G) with relations to the diameter D(G) and the average distance μ(G) of a graph G. We prove that for any connected graph G of order n with minimum degree δ(G), if δ...