当前位置:
X-MOL 学术
›
J. Comb. Theory B
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Most Laplacian eigenvalues of a tree are small
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2020-08-06 , DOI: 10.1016/j.jctb.2020.07.003 David P. Jacobs , Elismar R. Oliveira , Vilmar Trevisan
中文翻译:
一棵树的大多数拉普拉斯特征值很小
更新日期:2020-08-06
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2020-08-06 , DOI: 10.1016/j.jctb.2020.07.003 David P. Jacobs , Elismar R. Oliveira , Vilmar Trevisan
We show that the number of Laplacian eigenvalues less than the average degree of a tree having n vertices is at least .
中文翻译:
一棵树的大多数拉普拉斯特征值很小
我们表明,拉普拉斯特征值的数量小于平均度 具有n个顶点的树的长度至少为。