arXiv · math/0609572
Graphs and Hermitian matrices: exact interlacing
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Bela Bollobas, Vladimir Nikiforov. 2006-09-21. Graphs and Hermitian matrices: exact interlacing. https://arxiv.org/abs/math/0609572
Cite the original work for its findings. Save a collection to share your selection of sources.