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?
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?
Copyright © 2021 JogjaFile Inc.