Let G be an undirected connected graph with n, n\geqslant 3, vertices and m edges with Laplacian eigenvalues µ^{1}\geqslant µ_{2}\geq ...\geq µ_{n-1> µ_{n}}=0. Denote by {\mu _I} = {\mu _{{r_1}}} + {\mu _{{r_2}}} + \ldots + {\mu _{{r_k}}}, 1\leq k\leq n-2, 1\leq r_{1}< r_{2}< ...< r_{k} \leq n-1, the sum of k arbitrary Laplacian eigenvalues, with {\mu _{{I_1}}} = {\mu _1} + {\mu _2} + \ldots + {\mu _k} and {\mu _{{I_n}}} = {\mu _{n - k}} + \ldots + {\mu _{n - 1}}. Lower bounds of graph invariants {\mu _{{I_1}}} - {\mu _{{I_n}}} and {\mu _{{I_1}}}/{\mu _{{I_n}}} are obtained. Some known inequalities follow as a special case., Igor Ž. Milovanović, Emina I. Milovanović, Edin Glogić., and Obsahuje seznam literatury
Kragujevac (M. L. Kragujevac: On the Laplacian energy of a graph, Czech. Math. J. {\it 56}({\it 131}) (2006), 1207--1213) gave the definition of Laplacian energy of a graph $G$ and proved $LE(G)\geq 6n-8$; equality holds if and only if $G=P_n$. In this paper we consider the relation between the Laplacian energy and the chromatic number of a graph $G$ and give an upper bound for the Laplacian energy on a connected graph.
For a bipartite graph $G$ and a non-zero real $\alpha $, we give bounds for the sum of the $\alpha $th powers of the Laplacian eigenvalues of $G$ using the sum of the squares of degrees, from which lower and upper bounds for the incidence energy, and lower bounds for the Kirchhoff index and the Laplacian Estrada index are deduced.
The Laplacian spread of a graph is defined as the difference between the largest and second smallest eigenvalues of the Laplacian matrix of the graph. In this paper, bounds are obtained for the Laplacian spread of graphs. By the Laplacian spread, several upper bounds of the Nordhaus-Gaddum type of Laplacian eigenvalues are improved. Some operations on Laplacian spread are presented. Connected $c$-cyclic graphs with $n$ vertices and Laplacian spread $n-1$ are discussed.