论文信息 - Eigenvalues and perfect matchings

Eigenvalues and perfect matchings

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.

Andries E. Brouwer | Willem H. Haemers | W. Haemers | A. Brouwer

[1] W. Haemers. Interlacing eigenvalues and graphs , 1995 .

[2] G. Chartrand,et al. A sufficient condition for graphs with 1-factors , 1979 .

[3] Andries E. Brouwer,et al. The Connectivity of Strongly Regular Graphs , 1985, Eur. J. Comb..

[4] P. Hall. On Representatives of Subsets , 1935 .

[5] W. T. Tutte. The Factorization of Linear Graphs , 1947 .

[6] Michael Doob,et al. Spectra of graphs , 1980 .

[7] D. König. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .