Eigenvalues and forbidden subgraphs I
Abstract
Description
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
Some calculation errors in the first version are corrected