Centered tree

Given a graph, the eccentricity of a vertex v is defined as the greatest distance from v to any other vertex.

A center of a graph is a vertex with minimal eccentricity.

A graph can have an arbitrary number of centers.

However, Jordan (1869) has proved that for trees, there are only two possibilities: A proof of this fact is given, for example, by Harary.

This graph theory-related article is a stub.