The smallest eigenvalue of K_p-free graphs
Combinatorics
2007-05-23 v1
Abstract
We give an upper bound on the smallest eigenvalue of the adjacency matrix of graphs with no p-cliques.
Keywords
Cite
@article{arxiv.math/0410216,
title = {The smallest eigenvalue of K_p-free graphs},
author = {V. Nikiforov},
journal= {arXiv preprint arXiv:math/0410216},
year = {2007}
}
Comments
4 pages