Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

vertex connectivity and edge connectivity

The fewest vertices (or edges) that have to be removed to disconnect a graph -- a numeric measure of how resilient it is.

The vertex connectivity \kappa(G) is the minimum number of vertices whose removal disconnects G (or leaves a single vertex); the edge connectivity \lambda(G) is the minimum number of edges whose removal disconnects G.

See also

Menger's theorem
Read the full section →
Graph settings

Calculator