A new eigenvalue bound for independent sets

DOI10.1016/j.disc.2014.12.008zbMath1315.05086OpenAlexW2005635184MaRDI QIDQ2346340

Jochen Harant, Sebastian Richter

Publication date: 1 June 2015

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

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

zbMATH Keywords

eigenvaluesindependence number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Toughness and normalized Laplacian eigenvalues of graphs ⋮ Spectral bounds for the vulnerability parameters of graphs ⋮ \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs ⋮ Eigenvalue conditions for induced subgraphs

Cites Work

• The critical independence number and an independence decomposition
• Eigenvalue bounds for independent sets
• Spectral bounds for the clique and independence numbers of graphs
• The Gewirtz graph: An exercise in the theory of graph spectra
• Foreword: Special issue on stability in graphs and related topics
• Graphs and Hermitian matrices: eigenvalue interlacing
• Interlacing eigenvalues and graphs
• Interlacing for weighted graphs using the normalized Laplacian
• Eigenvalues of the Laplacian of a graph^∗
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new eigenvalue bound for independent sets