2
$\begingroup$

Could someone give me a hint for exercise 2.iii of these lecture notes? The exercise asks to show that a $k$-regular undirected graph (without loops) whose adjacency matrix $A$ has eigenvalues $k=\lambda_1(A) \geq \lambda_2(A) \geq \cdots \geq \lambda_n(A)$ satisfies $\max(|\lambda_2(A)|, |\lambda_n(A)|) \geq \sqrt{k} - o(1).$

  • 0
    Ah, yes. Thanks!2012-01-01

0 Answers 0