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
a Each column of A sums to k since each vertex connects to k others Thus A kP ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (2 attachments)
1623_606b0df16fbb7_699282.pdf
180 KBs PDF File
1623_606b0df16fbb7_699282.docx
120 KBs Word File
