# DM-Graphs-Q8

+1 vote

A represents an adjacency matrix of Graph G

$\begin{bmatrix} 0& 1&0&0\\ 1 & 0 & 1 & 1\\ 0 & 1 & 0 & 0\\ 0 & 1 & 0 & 0 \end{bmatrix}$

The number of paths of length 8  from vertex 1 to vertex 4.

reshown Jul 13