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 
is called the graph's edge
connectivity 
.
A single minimum edge cut of a connected graph 
can be found in the Wolfram
Language using the function FindEdgeCut[G].
See also
Disconnected Graph,
Edge Connectivity,
Edge Cut,
k-Edge-Connected
Graph,
Minimum Cyclic Edge Cut,
Vertex
Cut
Explore with Wolfram|Alpha
References
Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading,
MA: Addison-Wesley, 1990.West, D. B. Introduction
to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, p. 149,
2000.
Cite this as:
Weisstein, Eric W. "Minimum Edge Cut."
From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MinimumEdgeCut.html
Subject classifications
