Eigenvalues and Perfect Matchings

CentER Discussion Paper No. 2004-58

Posted: 14 Oct 2004

See all articles by Andries E. Brouwer

Andries E. Brouwer

Eindhoven University of Technology (TUE) - Department of Mathematics and Computing Science

Willem H. Haemers

Tilburg University - Department of Econometrics & Operations Research

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

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

Andries E. Brouwer (Contact Author)

Eindhoven University of Technology (TUE) - Department of Mathematics and Computing Science ( email )

5600 MB Eindhoven
Netherlands

Willem H. Haemers

Tilburg University - Department of Econometrics & Operations Research ( email )

P.O. Box 90153
5000 LE Tilburg
Netherlands

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Abstract Views
524
PlumX Metrics