A pseudo-peripheral vertex v has the property that for any vertex u, if v is as far away from u as possible, then u is as far away from v as possible.
The partition of a graph's vertices into subsets by their distances from a given starting vertex is called the level structure of the graph.