A note on eigenvalue bounds for independence numbers of non-regular graphs
From MaRDI portal
Publication:400541
DOI10.1016/j.dam.2014.04.008zbMath1297.05148MaRDI QIDQ400541
Publication date: 22 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.04.008
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C40: Connectivity
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extreme eigenvalues of nonregular graphs
- Eigenvalue bounds for independent sets
- On the spectrum of projective norm-graphs
- Spectral bounds for the clique and independence numbers of graphs
- Explicit construction of linear sized tolerant networks
- Norm-graphs: Variations and applications
- The largest eigenvalue of nonregular graphs
- Interlacing eigenvalues and graphs
- Eigenvectors and eigenvalues of non-regular graphs
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- Quasi-random graphs
- Proofs from THE BOOK