arXiv:math/0609572 [math.CO]AbstractReferencesReviewsResources
Graphs and Hermitian matrices: exact interlacing
Bela Bollobas, Vladimir Nikiforov
Published 2006-09-20, updated 2006-09-21Version 2
We prove conditions for equality between the extreme eigenvalues of a matrix and its quotient. In particular, we give a lower bound on the largest singular value of a matrix and generalize a result of Finck and Grohmann about the largest eigenvalue of a graph.
Subjects: 05C50
Related articles: Most relevant | Search more
Graphs and Hermitian matrices: discrepancy and singular values
arXiv:1910.01966 [math.CO] (Published 2019-10-04)
Inertia indices and eigenvalue inequalities for Hermitian matrices
arXiv:1207.3319 [math.CO] (Published 2012-07-13)
Lower bound for the rank of rigidity matrix of 4-valent graphs under various connectivity assumptions