The following is an adjacency matrix for a graph. Match answers to the questions
ID: 3547751 • Letter: T
Question
The following is an adjacency matrix for a graph. Match answers to the questions below by examining the matrix and its powers only.
v1 v2 v3 v4
v1 0 1 1 0
v2 1 0 2 1
v3 1 2 0 1
v4 0 1 1 1
How many walks of length 2 are there from v2 to v3?
How many walks of length 2 are there from v3 to v3?
How many walks of length 3 are there from v2 to v4?
How many walks of length 3 are there from v3 to v3?
answer choices
A. 2
B. 6
C. 11
D. 9
E. 3
F. 4
G. 8
H. 17
Explanation / Answer
C. 11
H. 17
B. 6
F. 4
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.