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

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 -λ. 

Step by Step Solution

3.47 Rating (154 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a Suppose G is bipartite and let v and w be vertices w... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (2 attachments)

PDF file Icon

1623_606b0df16fb55_699281.pdf

180 KBs PDF File

Word file Icon

1623_606b0df16fb55_699281.docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!