We show that the number of Laplacian eigenvalues greater than the average degree of a tree having $n$ vertices is at most $\lfloor\frac{n}{2} \rfloor$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。
