Graphs and Hermitian matrices: eigenvalue interlacing
From MaRDI portal
Publication:1763341
DOI10.1016/J.DISC.2004.07.011zbMATH Open1063.05088OpenAlexW2022582871MaRDI QIDQ1763341FDOQ1763341
Authors: Béla Bollobás, Vladimir Nikiforov 
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
Recommendations
- Graphs and Hermitian matrices: Exact interlacing
- Interlacing eigenvalues and graphs
- Interlacing Properties for Hermitian Matrices Whose Graph is a Given Tree
- Interlacing eigenvalues on some operations of graphs
- Hermitian matrices and graphs: Singular values and discrepancy
- scientific article; zbMATH DE number 5583324
- Eigenvalue interlacing and weight parameters of graphs
- Eigenvalues, multiplicities and graphs
- Eigenvalues, multiplicities and graphs
- Interlacing results on matrices associated with graphs
Cites Work
- Matrix Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interlacing eigenvalues and graphs
- Quasi-random graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eigenvalue interlacing and weight parameters of graphs
- Title not available (Why is that?)
- On the edge distribution of a graph
- Rayleigh-Ritz and A. Weinstein Methods for Approximation of Eigenvalues
Cited In (19)
- Lower bounds for the algebraic connectivity of graphs with specified subgraphs
- Some Minimal Graphs by Interlacing Eigenvalues
- A new eigenvalue bound for independent sets
- Spectra of large random trees
- Title not available (Why is that?)
- Upper bounds for the largest singular value of certain digraph matrices
- Inequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theory
- Eigenvalue bounds for independent sets
- Eigenvalue conditions for induced subgraphs
- Colouring the normalized Laplacian
- Graphs and Hermitian matrices: Exact interlacing
- Eigenvalues and forbidden subgraphs. I.
- Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
- Inertia indices and eigenvalue inequalities for Hermitian matrices
- The minimum spectral radius of \(K_{r + 1}\)-saturated graphs
- Eigenvalues and degree deviation in graphs
- Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
- The smallest eigenvalue of \(K_{r}\)-free graphs
- An interlacing technique for spectra of random walks and its application to finite percolation clusters
This page was built for publication: Graphs and Hermitian matrices: eigenvalue interlacing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763341)
