Eigenvalues and perfect matchings

被引：98
作者：
Brouwer, AE
Haemers, WH
机构：
[1] Tilburg Univ, Dept Econometr & Operat Res, NL-5000 LE Tilburg, Netherlands
[2] Eindhoven Univ Technol, Dept Math, NL-5600 MB Eindhoven, Netherlands
来源：
LINEAR ALGEBRA AND ITS APPLICATIONS | 2005年 / 395卷
关键词：
perfect matching; Laplacian matrix; eigenvalues; distance-regular graphs;
D O I：
10.1016/j.laa.2004.08.014
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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. (C) 2004 Elsevier Inc. All rights reserved.
引用
收藏
页码：155 / 162
页数：8
相关论文
共 11 条
[1]  
[Anonymous], 1985, European J. Combin
[2]  
Brouwer A.E., 1989, Distance-regular graphs
[3]  
Brualdi R. A., 1991, COMBINATORIAL MATRIX, V39
[4]  
CHARTRAND G, 1979, C MATH, V41, P339
[5]  
Cvetkovic D. M., 1980, Spectra of Graphs-Theory and Application
[6]  
FROBENIUS G, 1917, SITZUNGSBERICHTE KA, P456
[7]   INTERLACING EIGENVALUES AND GRAPHS [J].
HAEMERS, WH .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1995, 226 :593-616
[8]  
Hall P, 1935, J. Lond. Math. Soc., Vs1-10, P26, DOI [10.1112/jlms/s1-10.37.26, DOI 10.1112/JLMS/S1-10.37.26]
[9]  
König D, 1915, MATH ANN, V77, P453
[10]  
Konig D., 1931, Mat. Lapok, V38, P116
12