Minimum cut

In graph theory, a minimum cut of a graph is a cut (a partition of the vertices of a graph into two disjoint subsets that are joined by at least one edge) that is minimal in some sense. Variations of the minimum cut include:

A graph with n vertices can at the most have ${\displaystyle n(n-1)/2}$ distinct minimum cuts.

...
Wikipedia