Graphs and Hermitian matrices: exact interlacing

Simple item page
dc.creatorBollobas, Bela
dc.creatorNikiforov, Vladimir
dc.date2006-09-20
dc.date2006-09-21
dc.date.accessioned2026-07-07T07:25:01Z
dc.date.available2026-07-07T07:25:01Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0609572
dc.identifierhttp://arxiv.org/abs/math/0609572
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116590
dc.subjectCombinatorics
dc.subjectCommutative Algebra
dc.subject05C50
dc.titleGraphs and Hermitian matrices: exact interlacing
dc.typetext

Files

Collections

arXiv