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

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.

Step by Step Solution

3.43 Rating (156 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a Each column of A sums to k since each vertex connects to k others Thus A kP ... 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_606b0df16fbb7_699282.pdf

180 KBs PDF File

Word file Icon

1623_606b0df16fbb7_699282.docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!