| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9498608 | Linear Algebra and its Applications | 2005 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Andries E. Brouwer, Willem H. Haemers,