Metraipolis › archive › dc_4a3a5658e2e5
The Sharp Upper Bounds for the Median Eigenvalues of Graphs — arXiv:2608.09353
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.09353
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:09:01.990Z
- SHA-256 of the archived text
f543ac80ceabd4afccc9742d6bf3773d7b0a25492cb0f3db36147769b1774b93- Stable URL of this page
https://metraipolis.com/documento/dc_4a3a5658e2e5
How to cite
The Sharp Upper Bounds for the Median Eigenvalues of Graphs — arXiv:2608.09353 — arXiv (en), https://arxiv.org/abs/2608.09353 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4a3a5658e2e5 (Metraipolis archive dc_4a3a5658e2e5, sha256 f543ac80ceabd4afccc9742d6bf3773d7b0a25492cb0f3db36147769b1774b93)
BibTeX
@misc{dc4a3a5658e2e5,
title = {The Sharp Upper Bounds for the Median Eigenvalues of Graphs — arXiv:2608.09353},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.09353},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4a3a5658e2e5; sha256 f543ac80ceabd4afccc9742d6bf3773d7b0a25492cb0f3db36147769b1774b93},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09353. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $\lambda_1\geq\lambda_2\geq\cdots\geq\lambda_n$ be the eigenvalues of a simple graph $G$ of order $n$. The HL-index of $G$ is defined by $R(G)=\max\|\lambda_h|,|\lambda_\ell|\}$ with $h=\lfloor(n+1)/2\rfloor$ and $\ell=\lceil(n+1)/2\rceil$.In this paper, we prove that if $G$ is $ K_4$-minor-free or $ K _ {2,3} $-minor-free, then $R(G)\leq\sqrt{5}-1$ with equality attained by an infinite family of outerplanar this http URL , we show that $R(G)\leq\sqrt{d-2}$ for triangle-free graphs with maximum degree at most $d$ and average degree at most $(d-2)(d^2-2d+2)/(d^2-3d+5)$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.09353 — 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-19T09:05:33.582Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).