cut set | edge cut set

An edge cut, edge cut set, edge cutset, or sometimes simply "cut set" or "cutset" of a connected graph, is a set of edges of which, if removed (or "cut"), disconnects the graph (i.e., forms a disconnected graph). An edge cut set of size 1 corresponds to a graph bridge. The size of a minimum edge cut in a connected graph G gives the edge connectivity λ(G). An edge cut set of smallest size in a given connected graph g can be found in the Wolfram Language using the function FindEdgeCut[g]. For a not-necessarily-connected graph G, an edge cut is an edge set S such that G - S has more connected components than G.

cyclic edge connectivity | disconnected graph | edge connectivity | graph bridge | minimum edge cut | vertex cut