Let T be a tree and consider the Randic index chi (T) = Sigma (vi-vj) (1/ro
ot delta (v(i))delta (v(j))), where v(i)-v(j) runs over all edges of T and
delta (v(i)) denotes the degree of the vertex v(i). Using counting argument
s we show that the Randic index, is monotone increasing over the well (lexi
cographic order) ordered sequence of trees with unique branched vertex.