A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity λ(G). A single minimum edge cut of a connected graph G can be found in the Wolfram Language using the function FindEdgeCut[G].

disconnected graph | edge connectivity | edge cut | k-edge-connected graph | minimum cyclic edge cut | vertex cut

FindEdgeCut