I saw this sentence in Wikipedia:
A regular graph of degree k is connected if and only if the eigenvalue k has multiplicity one
I couldn't find a proof to that statement - can someone address me to a proof?
I saw this sentence in Wikipedia:
A regular graph of degree k is connected if and only if the eigenvalue k has multiplicity one
I couldn't find a proof to that statement - can someone address me to a proof?