On a conjecture between Randic index and average distance of unicyclic graphs
On a conjecture between Randic index and average distance of unicyclic graphs
The Randic index R(G) of a graph G is defined as R(G) = ?uv?E (d(u)d(v))-1/2 where the summation goes over all edges of G. In 1988, Fajtlowicz proposed a conjecture: For all connected graphs G with average distance ad(G), then R(G) ? ad(G). In this paper, we prove that this …