The Randić index of a graph G, denoted by R(G), is defined as the sum of 1/d(u)d(v) for all edges uv of G, where d(u) denotes the degree of a vertex u in G. In this note, we show that R(L(T))>n4 for any tree T of order n≥3. A number of relevant conjectures are proposed.
