A graph is called k-regular if k edges meet at each vertex. Let G be a k-regular

Question:

A graph is called k-regular if k edges meet at each vertex. Let G be a k-regular graph.
(a) Show that the adjacency matrix A of G has λ = k as an eigenvalue.

(b) Show that if A is primitive, then the other eigenvalues are all less than k in absolute value.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: