Recurrence Relations · Transfer-Matrix Method (Optional)
Lesson 7
Problem. Let \(G\) be a directed graph with adjacency matrix \(A=\left(\begin{smallmatrix}0&1&1\\ 1&0&1\\ 0&1&0\end{smallmatrix}\right)\). How many walks of length \(4\) are there in \(G\), over all choices of starting and ending vertices?
5 points