MinimumEccentricity on LabeledGraph
The least eccentricity of a vertex, the greatest distance from it to another vertex: the radius.
FindStat's St000260, of a connected graph; with two components every vertex has an infinite eccentricity. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "MinimumEccentricity"). The head's page has its examples.
Live
Distribution
Over LabeledGraphs at each size, tallied here in your browser; sizes past 6 are not offered.
FindStat St000260
The radius of a connected graph.
| Object | Value |
|---|---|
([],1) | 0 |
([(0,1)],2) | 1 |
([(0,2),(1,2)],3) | 1 |
([(0,1),(0,2),(1,2)],3) | 1 |
([(0,3),(1,2),(2,3)],4) | 2 |
([(0,3),(1,3),(2,3)],4) | 1 |
([(0,2),(0,3),(1,2),(1,3)],4) | 2 |
([(0,3),(1,2),(1,3),(2,3)],4) | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000260 has the rest.