首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Graphs and Hermitian matrices: Exact interlacing
Authors:Béla Bollobás  Vladimir Nikiforov
Institution:a Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA
b Department of Pure Mathematics & Mathematical Statistics, University of Cambridge Centre for Mathematical Sciences, Wilberforce Road, Cambridge CB3 0WB, UK
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.
Keywords:Extreme eigenvalues  Tight interlacing  Graph Laplacian  Singular values  Nonnegative matrix
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号