Sum of the $k$ Largest Eigenvalues of Symmetric Matrices: Theory and Applications

This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest eigenvalues of graphs and symmetric matrices, J. Combin. Theory Ser. B 99 (2009) 306–313]}. Furthermore, in the case of the Laplacian matrix, we prove that the well-known Brouwer’s conjecture {\bf [Spectra of Graphs, Springer, New York, 2012]} holds for small values of $k$ for almost all graphs, thereby taking a significant step toward its complete resolution.