k-vertex-connected graph

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.

The vertex-connectivity, or just connectivity, of a graph is the largest k for which the graph is k-vertex-connected.

A graph with connectivity 4.

Contents
1 Definitions
2 Applications
2.1 Polyhedral combinatorics
3 Computational complexity
4 See also