Walk-regular graph
= Walk-regular graph
{wiki=Walk-regular_graph}
A **walk-regular graph** is a type of graph that has a uniform structure relative to walks of certain lengths. Specifically, a graph is called \\( k \\)-walk-regular if the number of walks of length \\( k \\) from any vertex \\( u \\) to any other vertex \\( v \\) depends only on the distance between \\( u \\) and \\( v \\), rather than on the specific choice of \\( u \\) and \\( v \\).