Year: 2025
Type: preprint
Abstract: Let $G$ be a connected graph of order $n$ with girth $g$. For $k=1,\dots,\min\{g-1, n-g\}$, let $n(G,k)$ be the number of Laplacian eigenvalues (counting multiplicities) of $G$ that fall inside the interval $[n-g-k+4,n]$. We prove that if $g\ge 4$, then \[ n(G,k)\le n-g. \] Those graphs achieving the bound for $k=1,2$ are determined. We also determine the graphs $G$ with $g=3$ such that $n(G,k)=n-1, n-2, n-3$.
Source: arXiv (Cornell University)
Authors: Xu, Leyou, Zhou, Bo
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4414893806
Cites:
Cited by:
Related to: