TOPICS
Search

Minimum Cyclic Edge Cut


A minimum cyclic edge cut is a cyclic edge cut of smallest possible size for a given graph. The size of a minimum cyclic edge cut in G is known as the cyclic edge connectivity, denoted lambda_c(G).


See also

Cyclic Edge Connectivity, Cyclic Edge Cut, Edge Cut, Minimum Edge Cut

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Minimum Cyclic Edge Cut." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MinimumCyclicEdgeCut.html

Subject classifications