Suppose you have a graph G with vertices v₁, v₂, . . . , v₁₇. Explain how you would use the adjacency matrix A to ﬁnd
(a) The number of paths from $v _ { 5 } \text { to } v _ { 3 }$ of length 12.
(b) The length of a shortest path from $v _ { 5 } \text { to } v _ { 3 }$ .

Question

Suppose you have a graph G with vertices v₁, v₂, . . . , v₁₇. Explain how you would use the adjacency matrix A to ﬁnd
(a) The number of paths from

v _ { 5 } \text { to } v _ { 3 }

of length 12.
(b) The length of a shortest path from

v _ { 5 } \text { to } v _ { 3 }

.

Quizplus · Accepted Answer

The Answer of Suppose you have a graph G with vertices v₁, v₂, . . . , v₁₇. Explain how you would use the adjacency matrix A to ﬁnd (a) The number of paths from $v _ { 5 } \text { to } v _ { 3 }$ of length 12. (b) The length of a shortest path from $v _ { 5 } \text { to } v _ { 3 }$.

Suppose You Have a Graph G with Vertices V1, V2 v5 to v3v _ { 5 } \text { to } v _ { 3 }v5​ to v3​

Suppose You Have a Graph G with Vertices V₁, V₂ $v _ { 5 } \text { to } v _ { 3 }$