More on the full Brouwer Laplacian spectrum conjecture

Abstract

Brouwer conjectured that the sum of the first $k$ largest Laplacian eigenvalues of an $n$-vertex graph is less than or equal to the number of its edges plus $\binom{k+1}{2}$ for each $k\in \{1,2,\cdots,n\}$, which has come to be known as Brouwer's conjecture. Recently, Li and Guo further considered the case when the equalities hold in these conjectured inequalities, and proposed the full version of Brouwer's conjecture. In this paper, we first present a concise version of the full Brouwer's conjecture. Then we show that the full Brouwer's conjecture holds for two families of spanning subgraphs of complete split graphs and for $c$-cyclic graphs with $c\in\{0,1,2\}$. We also consider the Nordhaus-Gaddum version of the full Brouwer's conjecture and present partial solutions to it.