For a 2 R and a graph G, the general Randic´ index is defined as Ra(G) = Puv2E(G)[dG(u)dG(v)]a, where E(G) is the edge set of G, and dG(u) and dG(v) are degrees of the vertices u and v in G, respectively. For 0:64 a < 0, we give lower bounds on the general Randic´ index for unicyclic graphs with given number of pendant vertices, and with given order and number of pendant vertices. The extremal graphs are presented as well. Lower bounds on the classical Randic´ index are corollaries of our bounds on the general Randic´ index.