满二叉树的Laplacian特征值

The Laplacian Eigenvalues of Full Binary Tree

满二叉树的Laplacian矩阵有着高重数的特征值,其中1重复最为频繁。文章给出深度为h≥2的满二叉树的Laplacian特征值1的重数。

Repeated eigenvalues occur with high multiplicities in the Laplacian matrices of full binary trees. Among those eigenvalues, eigenvalue 1 is the most frequent one. In this paper, we give the multiplicity of eigenvalue 1.