加载中…
2018-04-02
On graphs with smallest eigenvalue at least -3 and their lattices
Jack H. KoolenJae Young YangQianqian Yang
文献摘要
In this paper, we show that a connected graph with smallest eigenvalue at least -3 and large enough minimal degree is 2-integrable. This result generalizes a 1977 result of Hoffman for connected graphs with smallest eigenvalue at least -2.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本