For a simple connected graph G of order n with Laplacian eigenvalues mu(1 )>= mu(2 )>= & ctdot; >= mu(n-1 )> mu(n )= 0, the Laplacian resolvent energy of G is defined as RL(G) = & sum;(n)(i=1 )1/n+1-mu(i). In this paper, we provide an improved lower bound for RL(G) through majorization. Considering our lower bound, we also derive some lower bounds for RL(G) when the graph G possesses tree structure.