Let G be a simple connected graph of order n and size m. The matrix L(G)= D(G)− A(G) is called the Laplacian matrix of the graph G,where D(G) and A(G) are the degree diagonal matrix and the adjacency matrix, respectively. Let the vertex degree sequence be d1 ≥ d2 ≥··· ≥ dn and let μ1 ≥ μ2 ≥··· ≥ μn−1 >μn = 0 be the eigenvalues of the Laplacian matrix of G. The graph invariants, Laplacian energy (LE), the Laplacian-energy-like invariant (LEL) and the Kirchhoff index (Kf), are defined in terms of the Laplacian eigenvalues of graph G, as