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.

connected component | edge cut | vertex cut