MaximumDistance on LabeledGraph
The greatest distance between two vertices: the diameter.
FindStat's St000259, of a connected graph; a graph with two components has an infinite diameter. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "MaximumDistance"). 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 St000259
The diameter of a connected graph.
| Object | Value |
|---|---|
([],1) | 0 |
([(0,1)],2) | 1 |
([(0,2),(1,2)],3) | 2 |
([(0,1),(0,2),(1,2)],3) | 1 |
([(0,3),(1,2),(2,3)],4) | 3 |
([(0,3),(1,3),(2,3)],4) | 2 |
([(0,2),(0,3),(1,2),(1,3)],4) | 2 |
([(0,3),(1,2),(1,3),(2,3)],4) | 2 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000259 has the rest.