Let G be an undirected simple, connected graph with n >= 3 vertices and m edges, with vertex degree sequence d >= d 2 >=....>= d n. The general Randic index is de fi ned by R-1 = Sigma((i,j)subset of E) 1/d(i)d(j) Lower and upper bounds for R-1 are obtained in this paper.