Laplacian eigenvalue distribution and girth of graphs
Linear Algebra and its Applications · 2026-09 · 744 · 190-203
DOI: 10.1016/j.laa.2026.05.003 ↗Kurz gefasst
Fachartikel in der Zeitschrift Linear Algebra and its Applications, 2026-09. Verfasst von Wenhao Zhen und 2 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Let $G$ be a connected graph on $n$ vertices with girth $g$. Let $m_GI$ denote the number of Laplacian eigenvalues of graph $G$ in an interval $I$. In this paper, we show that if $G$ is not a cycle, then $m_G(n-g+3,n]\leq n-g$. Moreover, we prove that $m_G(n-g+3,n]= n-g$ if and only if $G\cong C_3$ or $G\cong K_{3,2}$ or $G\cong U_1$, where $U_1$ is obtained from a cycle by joining a single vertex with a vertex of this cycle.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Zhen, W., Wong, D., & Xu, S. (2026). Laplacian eigenvalue distribution and girth of graphs. Linear Algebra and its Applications, 744, 190-203. https://doi.org/10.1016/j.laa.2026.05.003
Vancouver
Zhen W, Wong D, Xu S. Laplacian eigenvalue distribution and girth of graphs. Linear Algebra and its Applications. 2026;744:190-203. doi:10.1016/j.laa.2026.05.003
BibTeX
@article{Zhen2026,
author = {Zhen, Wenhao and Wong, Dein and Xu, Songnian},
title = {Laplacian eigenvalue distribution and girth of graphs},
journal = {Linear Algebra and its Applications},
year = {2026},
volume = {744},
pages = {190--203},
doi = {10.1016/j.laa.2026.05.003}
}
EUVIMED