If $α_n$ is the smallest eigenvalue of the matrix of adjacency of $G$, then there exists $v \in V$ such that $\lceil{\alpha _n}\rceil \leq d(v)$

37 Views Asked by At

Show that if $α_n$ is the smallest eigenvalue of the matrix of adjacency of a graph $G$, then there exists $v \in V$ such that $$\lceil{\alpha _n}\rceil \leq d(v)$$

I tried to prove it by contradiction without success. Any suggestion?