Gathering Information about a Graph by Counting Walks from a Single Vertex

Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky +1

We say that a vertex $v$ in a connected graph $G$ is decisive if the numbers of walks from $v$ of each length determine the graph $G$ rooted at $v$ up to isomorphism among all conn…