The smallest eigenvalue of K_p-free graphs

Abstract

We give an upper bound on the smallest eigenvalue of the adjacency matrix of graphs with no p-cliques.

4 pages

Cited by in corpus (1)

• $K_{r+1}$-saturated graphs with small spectral radius