Metraipolis › archive › dc_9b51348890ca
The number of Laplacian eigenvalues of trees less than one — arXiv:2610.06899
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.06899
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:52:57.878Z
- SHA-256 of the archived text
7b9ce0ed1bf663b916497687896c7ed4fd208b9e69cf6e1253930c708b2750f3- Stable URL of this page
https://metraipolis.com/documento/dc_9b51348890ca
How to cite
The number of Laplacian eigenvalues of trees less than one — arXiv:2610.06899 — arXiv (en), https://arxiv.org/abs/2610.06899 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9b51348890ca (Metraipolis archive dc_9b51348890ca, sha256 7b9ce0ed1bf663b916497687896c7ed4fd208b9e69cf6e1253930c708b2750f3)
BibTeX
@misc{dc9b51348890ca,
title = {The number of Laplacian eigenvalues of trees less than one — arXiv:2610.06899},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.06899},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9b51348890ca; sha256 7b9ce0ed1bf663b916497687896c7ed4fd208b9e69cf6e1253930c708b2750f3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06899. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $m_T[0,1)$ denote the number of Laplacian eigenvalues of a tree $T$ that are strictly less than $1$. Guo, Xue and Liu \cite{GXL} proved that every tree $T$ of diameter $d$ satisfies $m_T[0,1)\ge \lceil(d+1)/3\rceil$, and that this bound is sharp when $d\equiv2\pmod3$. It is classical that every graph of diameter $d$ has domination number at least $\lceil(d+1)/3\rceil$. In this paper, for any diameter $d$, $m_T[0,1)=\lceil(d+1)/3\rceil$ if and only if $\gamma(T)=\lceil(d+1)/3\rceil$; we characterize all trees satisfying this necessary and sufficient condition, and also prove that almost all trees satisfy $m_T[0,1)\ge\lceil(d+1)/3\rceil+1$.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.06899 — 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-07T11:22:09.518Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).