2023/12/08 by Xu, Leyou, Zhou, Bo · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2312.04797
For a simple graph on n vertices, any of its signless Laplacian eigenvalues is in the interval [0, 2n-2]. In this paper, we give relationships between the number of signless Laplacian eigenvalues in specific intervals in [0, 2n-2] and graph invariants including matching number and diameter.