Abstract 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 G,where D(G) are degree diagonal adjacency matrix, respectively. vertex sequence d1 ≥ d2 ≥··· dn let μ1 μ2 μ n−1 >μn = 0 eigenvalues G. invariants, energy (LE), Laplacian-energy-like invariant (LEL) Kirchhoff index (Kf), defined in terms G, as <m:math xmlns:m="http://www.w3.o...