The nth power of an adjacency matrix yields the number of length-n walks from any vertex to any other vertex.