Eigenvalues and Perfect Matchings
CentER Discussion Paper No. 2004-58
Posted: 14 Oct 2004
Date Written: July 2004
Abstract
We give sufficient conditions for existence of a perfect matching in a graph in terms of the eigenvalues of the Laplacian matrix. We also show that a distance-regular graph of degree k is k-edge-connected.
Keywords: Matching, eigenvalues
Suggested Citation: Suggested Citation
Brouwer, Andries E. and Haemers, Willem H., Eigenvalues and Perfect Matchings (July 2004). CentER Discussion Paper No. 2004-58, Available at SSRN: https://ssrn.com/abstract=603281
Feedback
Feedback to SSRN