Let G be a bipartite graph with adjacency matrix A. (a) Show that A is not primitive.

Question:

Let G be a bipartite graph with adjacency matrix A.
(a) Show that A is not primitive.
(b) Show that if l is an eigenvalue of A, so is -λ. 

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

Step by Step Answer:

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