In this paper we will give a structure theory for regular graphs with fixed smallest eigenvalue. As a consequence of this theory, we show that a $k$-regular graph with smallest eigenvalue $-λ$ has clique number linear in $k$ if $k$ is large with respect to $λ$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。