Given a weighted, undirected graph and a graphical partition of into two sets and , the cut of with respect to and is defined as
where denotes the weight for the edge connecting vertices and . The weight of the cut is the sum of weights of edges crossing the cut.