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.

# Cut Set

## See also

Connected Component, Edge Cut, Vertex Cut## Explore with Wolfram|Alpha

## Cite this as:

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