The eccentricity ϵ(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all vertices are defined to have infinite eccentricity. The maximum eccentricity is the graph diameter. The minimum graph eccentricity is called the graph radius.