Back K-Zusammenhang German Graphe sommet-connexe French K-szorosan összefüggő gráf Hungarian K-頂点連結グラフ Japanese Graf k-spójny Polish Grafo k-vértice-conexo Portuguese Graf k-conex Romanian Вершинно k-связный граф Russian K-вершинно-зв'язний граф Ukrainian K-liên thông Vietnamese
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.