More spectral bounds on the clique and independence numbers

Abstract

We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…