On Brouwer's conjecture for the sum of \(k\) largest Laplacian eigenvalues of graphs (Q2321369): Difference between revisions

For a graph \(G\) with \(n\) vertices and \(m\) edges, let \(\mathcal{S}_k(G)\) be the sum of the \(k\) largest Laplacian eigenvalues of \(G\). \textit{A. E. Brouwer} and \textit{W. H. Haemers} [Spectra of graphs. Berlin: Springer (2012; Zbl 1231.05001)] conjectured that \[ \mathcal{S}_k(G) \leq m + k +\frac{1}{2}, \] for any \(1\leq k\leq n\). In this paper, the author shows that if Brouwer's conjecture is true for all graphs with \(k = p\), with \(1 \leq p \leq (n - 1)/2\), then it is also true for all graphs when \(k = n -p - 1\). In addition, if the conjecture is true for a graph \(G\), then it is also true for its complement.