Hello !
I am studying about adjacency matrices and i cannot understand the following:
"It is sometimes helpful to use the fact that the (i,j) entry of the adjacency matrix raised to the k-th power gives the number of paths from vertex i to vertex j consisting of exactly k edges. "
Can someone help me?