加载中…
We study the distribution of -eigenvalues of a tree. We extend the works \cite{Jacobs2021} and \cite{SIN2020} by proving that the number of -eigenvalues, for , less than or equal to the average degree is, at least, for a tree with vertices. Several counterexamples for are exhibited. We also derive the same result for other well-known families such as the Deformed Laplacian and the matrix .

生成讲解博客的中文版本

生成AI智能校验的中文版本