Minimum Edge Cut

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 lambda(G).

A single minimum edge cut of a connected graph G can be found in the Wolfram Language using the function FindEdgeCut[G].

See also

Disconnected Graph, Edge Connectivity, Edge Cut, k-Edge-Connected Graph, Vertex Cut

Explore with Wolfram|Alpha


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.

Subject classifications