ON THE NUMBER OF LAPLACIAN EIGENVALUES OF TREES SMALLER THAN TWO
ON THE NUMBER OF LAPLACIAN EIGENVALUES OF TREES SMALLER THAN TWO
Let $m_T[0,2)$ be the number of Laplacian eigenvalues of a tree $T$ in $[0,2)$, multiplicities included. We give best possible upper bounds for $m_T[0,2)$ using the parameters such as the number of pendant vertices, diameter, matching number, and domination number, and characterize the trees $T$ of order $n$ with $m_T[0,2)=n-1$, …