A cut of a finite weighted undirected graph 
that is simple
is specified by a set partition of 
into two sets 
and 
. Its weight is
 |
where 
is the weight
of the edge joining vertices 
and 
,
or 0 if no such edge exists.
Cut
See also
Articulation Vertex, Branch Cut, Directed Cut, Edge Cut, Maxcut, Min-UnCut, Mincut, Sparsest Cut, Uniform Sparsest Cut, Vertex CutExplore with Wolfram|Alpha
References
Demmel, J. "CS 267: Lectures 20 and 21, Mar 21, 1996 and Apr 2, 1996. Graph Partitioning, Part 1." https://people.eecs.berkeley.edu/~demmel/cs267/lecture18/lecture18.html.Referenced on Wolfram|Alpha
CutCite this as:
Weisstein, Eric W. "Cut." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Cut.html