A set of edges of a graph which, if removed (or "cut"), disconnects the graph (i.e., forms a disconnected graph).

Skiena, S. "Reconstructing Graphs from Cut-Set Sizes." Info. Proc. Lett. 32, 123-127, 1989.

Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, 1990.

CITE THIS AS:

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