INTERLACING EIGENVALUES AND GRAPHS

被引:365
作者
HAEMERS, WH
机构
关键词
D O I
10.1016/0024-3795(95)00199-2
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We give several old and some new applications of eigenvalue interlacing to matrices associated to graphs. Bounds are obtained for characteristic numbers of graphs, such as the size of a maximal (co)clique, the chromatic number, the diameter, and the bandwidth, in terms of the eigenvalues of the standard adjacency matrix or the Laplacian matrix. We also deal with inequalities and regularity results concerning the structure of graphs and block designs.
引用
收藏
页码:593 / 616
页数:24
相关论文
共 35 条
[1]   2-DESIGNS HAVING AN INTERSECTION NUMBER K-N [J].
BEKER, H ;
HAEMERS, W .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1980, 28 (01) :64-81
[2]  
Brouwer A.E., 1985, EUR J COMBIN, V6, P215
[3]  
Brouwer A.E., 1989, DISTANCE REGULAR GRA
[4]   THE GEWIRTZ GRAPH - AN EXERCISE IN THE THEORY OF GRAPH SPECTRA [J].
BROUWER, AE ;
HAEMERS, WH .
EUROPEAN JOURNAL OF COMBINATORICS, 1993, 14 (05) :397-407
[5]  
BROUWER AE, 1995, LINEAR ALGEBRA APPL, V226, P267, DOI 10.1016/0024-3795(95)00154-J
[6]  
COURANT R, 1924, METHODEN MATH PHYSIK
[7]  
Cvetkovi D.M, 1971, PUB ELEK FAK U BEOGR, V354/356, P1
[8]  
Cvetkovic DM., 1979, SPECTRA GRAPHS
[9]   DIAMETER, COVERING INDEX, COVERING RADIUS AND EIGENVALUES [J].
DELORME, C ;
SOLE, P .
EUROPEAN JOURNAL OF COMBINATORICS, 1991, 12 (02) :95-108
[10]  
Delsarte P., 1991, GEOMETRY COMBINATORI, P68