Eigenvalues and forbidden subgraphs I
组合数学
2007-05-23 v2 交换代数
摘要
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.
引用
@article{arxiv.math/0608329,
title = {Eigenvalues and forbidden subgraphs I},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:math/0608329},
year = {2007}
}
备注
Some calculation errors in the first version are corrected