Graphs and Hermitian matrices: eigenvalue interlacing

DOI10.1016/j.disc.2004.07.011zbMath1063.05088OpenAlexW2022582871MaRDI QIDQ1763341

Vladimir Nikiforov, Béla Bollobás

Publication date: 22 February 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.011

zbMATH Keywords

Laplaciansmallest eigenvaluesecond eigenvaluepartitioned matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (14)

Eigenvalues and degree deviation in graphs ⋮ Colouring the normalized Laplacian ⋮ Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \) ⋮ Lower bounds for the algebraic connectivity of graphs with specified subgraphs ⋮ Eigenvalues and forbidden subgraphs. I. ⋮ The minimum spectral radius of \(K_{r + 1}\)-saturated graphs ⋮ An interlacing technique for spectra of random walks and its application to finite percolation clusters ⋮ Eigenvalue bounds for independent sets ⋮ Graphs and Hermitian matrices: Exact interlacing ⋮ The smallest eigenvalue of \(K_{r}\)-free graphs ⋮ Upper bounds for the largest singular value of certain digraph matrices ⋮ Spectra of large random trees ⋮ Eigenvalue conditions for induced subgraphs ⋮ A new eigenvalue bound for independent sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvalue interlacing and weight parameters of graphs
• Interlacing eigenvalues and graphs
• On the Edge Distribution of a Graph
• Matrix Analysis
• Rayleigh-Ritz and A. Weinstein Methods for Approximation of Eigenvalues
• Quasi-random graphs

This page was built for publication: Graphs and Hermitian matrices: eigenvalue interlacing