加载中…
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which consists of 13 classes of specific graphs. These 13 classes hint that , where is the minimum real number for which every real number greater than is a limit point in the set of the second largest eigenvalues of the simple connected graphs. We leave it as a problem.

生成讲解博客的中文版本

生成AI智能校验的中文版本