























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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。