The spread of the spectrum of a graph

被引:63
作者
Gregory, DA
Hershkowitz, D
Kirkland, SJ
机构
[1] Queens Univ, Dept Math & Stat, Kingston, ON K7L 3N6, Canada
[2] Technion Israel Inst Technol, Dept Math, IL-32000 Haifa, Israel
[3] Univ Regina, Dept Math & Stat, Regina, SK S4S 0A2, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
eigenvalues; spread; adjacency matrix;
D O I
10.1016/S0024-3795(00)00086-0
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Upper and lower bounds are obtained for the spread lambda (1) - lambda (n) of the eigenvalues lambda (1) greater than or equal to lambda2 greater than or equal to ...greater than or equal to h, of the adjacency matrix of a simple graph. (C) 2001 Elsevier Science Inc. All rights reserved.
引用
收藏
页码:23 / 35
页数:13
相关论文
共 14 条
[1]  
[Anonymous], 1997, EIGENSPACES GRAPHS E
[2]  
[Anonymous], 1994, NONNEGATIVE MATRICES, DOI DOI 10.1137/1.9781611971262
[3]  
[Anonymous], LINEAR MULTILINEAR A
[4]  
Bondy J.A., 2008, GRAD TEXTS MATH
[5]  
Brouwer A.E., 1989, DISTANCE REGULAR GRA
[6]  
Collatz L., 1957, Abh. Math. Sem. Univ. Hamburg, V21, P63, DOI DOI 10.1007/BF02941924
[7]  
CVETKOVIC DM, 1979, SPECTRA GRAPHS
[8]  
Haemers W. H., 1980, MATH CTR TRACTS, V121
[9]  
Horn R. A., 1986, Matrix analysis
[10]   LOWER BOUNDS FOR THE SPREAD OF A MATRIX [J].
JOHNSON, CR ;
KUMAR, R ;
WOLKOWICZ, H .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1985, 71 (NOV) :161-173