Level structure

An example for an undirected Graph with a vertex r and its corresponding level structure

In the mathematical subfield of graph theory a level structure of a rooted graph is a partition of the vertices into subsets that have the same distance from a given root vertex.