Of Notes
Path counts in the Tutorial 1 graphs
Problem
Use the adjacency matrices from exercise 2 to prove that the left graph of exercise 1 has exactly four paths of length three and no paths of length 4 or larger. Argue why the middle and right graphs contain paths of every length