A note on multiplicity of the Laplacian eigenvalue of trees

Considering the multiplicity m_T(¿) of eigenvalue ¿ (which equals 1) of Laplacian matrix of all trees, we get three results: When m_T(1) equals n-2, the tree is unique, that is star graph K_{1, n-1}; (ii) there exists no trees satisfying m_T(1) equals n-3; (iii) When m_T(1) equals n-4, this kind of trees are divided into two types. According to the process of proving, we devise a method to construct trees on some desired properties, which have practical value.