GraphEdgeConnectivity on LabeledGraph
The fewest edges whose deletion leaves a disconnected graph: the fewest edges between a set of vertices and the rest.
FindStat's St000261. A disconnected graph gives 0, and so does the graph with one vertex. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "GraphEdgeConnectivity"). 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 St000261
The edge connectivity of a graph.
| Object | Value |
|---|---|
([],1) | 0 |
([],2) | 0 |
([],3) | 0 |
([],4) | 0 |
([],5) | 0 |
([],6) | 0 |
([(0,1)],2) | 1 |
([(1,2)],3) | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000261 has the rest.