Bounding the sum of the largest signless Laplacian eigenvalues of a graph (Q6048441)

The authors in the first part improve the existing bound \(q_1(G)+q_2(G)\geq d_1(G)+d_2(G)\) for the sum of two largest signless Laplacian eigenvalues \(q_1(G)\) and \(q_2(G)\), which follows either from the Schur's inequality or from the inequalities \(q_1(G)\geq d_1(G)+1\) from [\textit{D. Cvetković} et al., Publ. Inst. Math., Nouv. Sér. 81(95), 11--27 (2007; Zbl 1164.05038)] and \(q_2(G)\geq d_2(G)-1\) from [\textit{K. Ch. Das}, Linear Algebra Appl. 432, No. 11, 3018--3029 (2010; Zbl 1195.05040)] by a unit constant: \(q_1(G)+q_2(G)\geq d_1(G)+d_2(G)+1\). In the second part, the authors then use a new instance of interlacing inequalities to deduce new bounds for the sums of either several largest or several smallest signless Laplacian eigenvalues, which relate these sums to appropriate degrees and cut sizes.