Explore relationships

Vertex connectivity

In graph theory, a connected graph G is said to be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever fewer than k vertices are removed.

Use + to expand a branch. Click a topic name to open its summary.