Girth on LabeledGraph
The length of the shortest cycle.
FindStat's St000264, of a graph that is not a tree; a graph without a cycle has an infinite girth. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "Girth"). 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 St000264
The girth of a graph, which is not a tree.
| Object | Value |
|---|---|
([(0,1),(0,2),(1,2)],3) | 3 |
([(1,2),(1,3),(2,3)],4) | 3 |
([(2,3),(2,4),(3,4)],5) | 3 |
([(3,4),(3,5),(4,5)],6) | 3 |
([(4,5),(4,6),(5,6)],7) | 3 |
([(0,1),(2,3),(2,4),(3,4)],5) | 3 |
([(0,2),(0,3),(1,2),(1,3)],4) | 4 |
([(0,3),(1,2),(1,3),(2,3)],4) | 3 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000264 has the rest.