加载中…
Let be a regular graph with edges, and let denote the two largest eigenvalues of , the adjacency matrix of . We show that, if is not complete, then where is the clique number of . This confirms a conjecture of Bollobás and Nikiforov for regular graphs. We also show that equality holds if and only if is either a balanced Turán graph or the disjoint union of two balanced Turán graphs of the same size.

生成讲解博客的中文版本

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