Note on a conjecture for the sum of signless Laplacian eigenvalues
For a simple graph on vertices and an integer with , denote by the sum of largest signless Laplacian eigenvalues of . It was conjectured that , where is the number of edges of . This conjecture has been proved to be true for all graphs when , and for trees, unicyclic graphs, bicyclic graphs and regular graphs (for all ). In this note, this conjecture is proved to be true for all graphs when , and for some new classes of graphs.