![2. Consider a graph G with adjacency matrix 0 0 1 1 How many walks of length 3 exist in G? Show your work.](https://media.cheggcdn.com/media%2F273%2F273a61d6-3fd1-4727-bae9-76b16fd72527%2Fimage.png)
2. Consider a graph G with adjacency matrix 0 0 1 1 How many walks of length 3 exist in G? Show your work. Show transcribed image text 2. Consider a graph G with adjacency matrix 0 0 1 1 How many walks of length 3 exist in G? Show your work.
Solution
![2 4 a 2) 1 1 リa-c-b-d s) d-b-c ad c-d a 4) a d-b - C ) b-d-c-a to) b- d -aC 0 12) c-b-d-a not nclded eseu LLX](https://media.cheggcdn.com/media%2F504%2F50431e72-3492-49ba-9514-73ec90bf1e09%2FphpXTM2vH.png)
2