arXiv (All)
open access
On the Brouwer-type Conjecture for Signless Laplacian Eigenvalues of Graphs
Motivated by Brouwer's conjecture, Ashraf, Omidi and Tayfeh-Rezaie proposed the following Brouwer-type conjecture that for every graph $G$ on $n$ vertices with $m$ edges, the sum $S_k^+(G)$ of its $k$ largest signless Laplacian eigenvalues satisfies $S_k^+(G)\le m+\binom{k+1}{2}$ for $k=1, \ldots, n
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Improved Bounds for the Bilu--Linial Conjecture via Spectral Recovery from Mixed Determinantal Polynomials#1109686
- Parameterized Enumeration of Minimal Defensive Alliances#1064528
- A Truncated Singular-Value Bound for Spectral Variation of Normal Matrices#986950
- Minimal transitive factorizations supported on quasi-threshold graphs#1115938
- Optimal central limit theorem for bounded random variables in high dimensions#975131
Record · ID 1106054
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive