Edge Connectivity Calculator

min edge cut λ(G)

All Tools

Loading tool...

About Edge Connectivity Calculator

An edge connectivity calculator computing λ(G): minimum edge cut size. κ(G) ≤ λ(G) ≤ δ(G). λ(K_n) = n-1. Menger's theorem (edge version): λ equals max number of edge-disjoint paths between any pair. Client-side.

Edge Connectivity Calculator Features

  • λ(G) value
  • Whitney bound
  • Bridge detection
  • Common graphs
  • Max-flow
Advertisement
Advertisement