BridgeCount on LabeledGraph
The edges whose deletion leaves more components.
FindStat's St001479. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "BridgeCount"). 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 St001479
The number of bridges of a graph.
| Object | Value |
|---|---|
([],1) | 0 |
([],2) | 0 |
([],3) | 0 |
([],4) | 0 |
([],5) | 0 |
([],6) | 0 |
([],7) | 0 |
([(0,1)],2) | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001479 has the rest.