A note on eigenvalue bounds for independence numbers of non-regular graphs
DOI10.1016/J.DAM.2014.04.008zbMATH Open1297.05148OpenAlexW1974676765MaRDI QIDQ400541FDOQ400541
Authors: Yusheng Li, Zhen Zhang
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Interlacing eigenvalues and graphs
- Title not available (Why is that?)
- Eigenvalue bounds for independent sets
- Title not available (Why is that?)
- Quasi-random graphs
- Explicit construction of linear sized tolerant networks
- Norm-graphs: Variations and applications
- Title not available (Why is that?)
- Proofs from THE BOOK
- On the spectrum of projective norm-graphs
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- Spectral bounds for the clique and independence numbers of graphs
- The largest eigenvalue of nonregular graphs
- Eigenvectors and eigenvalues of non-regular graphs
- Extreme eigenvalues of nonregular graphs
Cited In (5)
This page was built for publication: A note on eigenvalue bounds for independence numbers of non-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q400541)