Metraipolis › archive › dc_d81f186bc82d
A proof of the maximum Laplacian energy conjecture for connected graphs via a sharp eigenvalue-sum bound — arXiv:2609.06442
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06442
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:48:34.813Z
- SHA-256 of the archived text
169396fa1f3f84471ced7bb8dd62d28b2eae02ef92ee25c8567838657c3952ce- Stable URL of this page
https://metraipolis.com/documento/dc_d81f186bc82d
How to cite
A proof of the maximum Laplacian energy conjecture for connected graphs via a sharp eigenvalue-sum bound — arXiv:2609.06442 — arXiv (en), https://arxiv.org/abs/2609.06442 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d81f186bc82d (Metraipolis archive dc_d81f186bc82d, sha256 169396fa1f3f84471ced7bb8dd62d28b2eae02ef92ee25c8567838657c3952ce)
BibTeX
@misc{dcd81f186bc82d,
title = {A proof of the maximum Laplacian energy conjecture for connected graphs via a sharp eigenvalue-sum bound — arXiv:2609.06442},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06442},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d81f186bc82d; sha256 169396fa1f3f84471ced7bb8dd62d28b2eae02ef92ee25c8567838657c3952ce},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06442. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $S_k(G)$ denote the sum of the $k$ largest Laplacian eigenvalues of a connected graph $G$ of order $n$ and size $m$. Write $\mathrm{PA}_{n,\omega}$ for the graph obtained from an $\omega$-vertex clique by attaching $n-\omega$ pendant vertices to one of its vertices, and set \[ M_{n,k}:=\binom{k+1}{2}+n-k-1, \] the number of edges of $\mathrm{PA}_{n,k+1}$. For $n/2<k\le n-2$, we prove the sharp bound \[ S_k(G)\le \frac{2k}{n}m+ \frac{2(n-k)}{n}M_{n,k}-(n-k-1), \] with equality attained by $\mathrm{PA}_{n,k+1}$. This bound is complementary to Brouwer's inequality and is strictly stronger when $m<M_{n,k}$. Combining our bound with Brouwer's inequality, we resolve and strengthen a conjecture of Vinagre, Del-Vecchio, Justo, and Trevisan: for every $n$, the pineapple $\mathrm{PA}_{n,1+\lfloor2n/3\rfloor}$ maximizes the Laplacian energy among all connected graphs of order $n$; moreover, for $n>4$, it is the unique maximizer.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.06442 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:32:29.789Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).