Laplacain eigenvalue distribution and diameter of graphs

MaRDI QIDQ6441388zbMATH OpenFDO

Authors Leyou Xu, Bo Zhou

Publication date 25 June 2023

Abstract: Let $G$ be a connected graph on $n$ vertices with diameter $d$. It is known that if $2ledlen-2$, there are at most $n-d$ Laplacian eigenvalues in the interval $[n-d+2,n]$. In this paper, we show that if $1ledlen-3$, there are at most $n-d+1$ Laplacian eigenvalues in the interval $[n-d+1,n]$. Moreover, we try to identify the connected graphs on $n$ vertices with diameter $d$, where $2ledlen-3$, such that there are at most $n-d$ Laplacian eigenvalues in the interval $[n-d+1,n]$.

This page was built for publication: Laplacain eigenvalue distribution and diameter of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6441388)