Eigenvalues and forbidden subgraphs I
arXiv:math/0608329
Abstract
We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.
Some calculation errors in the first version are corrected