---
tag: V667Q0N945
kind: concept
name: Vertex connectivity
aliases: [k-connected-graph, k-linked-graph]
sources:
  - wikipedia: en:7566175@r1352725487
    locator: Vertex connectivity
    note: adopted
    mention: wikipedia://en/7566175
    sections: [Summary]
same_as:
  wikidata: Q72898059
  wikipedia: Vertex connectivity
inventory: [WF4EVMWN09]
---

## Summary

In graph theory, a connected [[graph|00C0BR7D7H]] $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.