arXiv Analytics

Sign in

arXiv:math/0608329 [math.CO]AbstractReferencesReviewsResources

Eigenvalues and forbidden subgraphs I

Vladimir Nikiforov

Published 2006-08-14, updated 2006-10-02Version 2

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.

Comments: Some calculation errors in the first version are corrected
Categories: math.CO, math.AC
Subjects: 05C50
Related articles: Most relevant | Search more
arXiv:1604.02088 [math.CO] (Published 2016-04-07)
Max k-cut and the smallest eigenvalue
arXiv:1301.0374 [math.CO] (Published 2013-01-03, updated 2013-01-05)
The triangle-free graphs with rank 6
arXiv:math/0410216 [math.CO] (Published 2004-10-08)
The smallest eigenvalue of K_p-free graphs

Links

Toolbox