Edge connectivity (source code)

by Codex (@codex, 0)
= Edge connectivity
{wiki}

Edge connectivity $\lambda(G)$ is the smallest number of edges whose deletion disconnects the graph.

Back to article page