REVIEW 2 cited by
More on the full Brouwer Laplacian spectrum conjecture
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
Forward citations
Cited by 2 Pith papers
-
A Matching-Number Refinement of Brouwer's Laplacian Eigenvalue Inequality
The inequality ε_k(G) ≤ kν(G) holds for all graphs in the range 1≤k≤n(G)−2, resolving Lew's conjecture, with all equality cases characterized.
-
Sums of Laplacian eigenvalues and sums of degrees
For any simplicial complex, the sum of the k largest upper-Laplacian eigenvalues is at most the sum of the (r+1)k largest r-degrees of (r-1)-faces, with applications to graphs and partite complexes.
Discussion (0). Continue with ORCID to comment.