b. Let G be the graph with vertices v1, v2, and v3 and
Chapter 10, Problem 19E(choose chapter or problem)
Problem 19E
b. Let G be the graph with vertices v1, v2, and v3 and with A as its adjacency matrix. Use the answers to part (a) to find the number of walks of length 2 from v1 to v3 and the number of walks of length 3 from v1 to v3. Do not draw G to solve this problem.
c. Examine the calculations you performed in answering part (a) to find five walks of length 2 from v3 to v3. Then draw G and find the walks by visual inspection.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer