The smallest eigenvalue of K_p-free graphs
classification
🧮 math.CO
keywords
eigenvaluegraphssmallestadjacencyboundgivematrixp-cliques
read the original abstract
We give an upper bound on the smallest eigenvalue of the adjacency matrix of graphs with no p-cliques.
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.