Cut Set

A cut set of a graph is a set of graph components whose removal results in more than one connected component. The most common types of cut sets are vertex cuts and edge cuts.

See also

Connected Component, Edge Cut, Vertex Cut

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

Cite this as:

Weisstein, Eric W. "Cut Set." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CutSet.html

Subject classifications