I am studying graph theory and I am not sure about how the power of the adjacency works. I know that the $k$-th powers of $A$ tell us about connections in the graph, and I can read lengths between a vertex to vertex after taking powers of the adjacency matrix.
My question is: why can powers of the adjacency matrix determine connections in the graph, and how many powers need to determine it?