"If is the adjacency matrix of a -regular graph, then any row of contains exactly 1’s. Thus, the vector 1=1,1,…,1 is an eigenvector of with eigenvalue ."
How do we know that only having rows with exactly 1's will give us an eigenvector of (1,1...,1)?
Thanks!