Randić Index of Some Class of Trees with an Algorithm

The Randic index R(G) of a graph G is defined as the sum of the weights (dG(u)dG(v)) -1/2 over all edges e = uv of G. In this paper we have obtained the Randic index of some class of trees and of their complements. Also further developed an algorithmic