**EXPERT ANSWER**

# Note that for the following question you should use technology to do the matrix calculations. Consider a graph with the following adjacency matrix: /1 0 1 0 0 1 0 0 1 1 0 0 1 1 1 1 1 1 0 1 1 1 0 1 0 0 1 0 1 0 1 0 1 1 0 1 Assuming the nodes are labelled 1,2,3,4,5,6 in the same order as the rows and columns, answer the folllowing questions: (a) How many walks of length 2 are there from node 5 to itself? (b) How many walks of length 5 are there from node 5 to itself? (c) How many walks of length 5 are there from node 4 to node 2? (d) How many walks of length 6 are there from node 4 to node 2?

Get full Expert solution in seconds

**$1.97** ONLY