More spectral bounds on the clique and independence numbers
classification
🧮 math.CO
keywords
boundscliqueindependencenumberseigenvaluesgivegraphsome
read the original abstract
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.