On the eigenvalue two and matching number of a tree (Q705080): Difference between revisions

\textit{G. Ming} and \textit{T. Wang} [Linear Algebra Appl. 325, 71--74 (2001; Zbl 0971.05071)] proved that 2 is an eigenvalue of the Laplacian of any tree which has a perfect matching. In this paper the author considers the following problem: whether 2 is an eigenvalue of the Laplacian of a tree without perfect matchings. It is shown that if the matching number (the size of a largest matching) of a tree is 1 or 2, then the tree does not have 2 as an eigenvalue; otherwise there exists a tree with the given matching number which has (has not) the eigenvalue 2. All trees with matching number 3 and eigenvalue 2 are also determined.