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 (other than a complete graph) has connectivity k if k is the size of the smallest subset of vertices such that the graph becomes disconnected if you delete them.^[1] In complete graphs, there is no subset whose removal would disconnect the graph. Some sources modify the definition of connectivity to handle this case, by defining it as the size of the smallest subset of vertices whose deletion results in either a disconnected graph or a single vertex. For this variation, the connectivity of a complete graph ${\displaystyle K_{n}}$ is ${\displaystyle n-1}$.^[2]

An equivalent definition is that a graph with at least two vertices is k-connected if, for every pair of its vertices, it is possible to find k vertex-independent paths connecting these vertices; see Menger's theorem (Diestel 2005, p. 55). This definition produces the same answer, n − 1, for the connectivity of the complete graph K_n.^[1]

A 1-connected graph is called connected; a 2-connected graph is called biconnected. A 3-connected graph is called triconnected.

Every graph decomposes into a disjoint union of 1-connected components. 1-connected graphs decompose into a tree of biconnected components. 2-connected graphs decompose into a tree of triconnected components.

The 1-skeleton of any k-dimensional convex polytope forms a k-vertex-connected graph (Balinski's theorem).^[3] As a partial converse, Steinitz's theorem states that any 3-vertex-connected planar graph forms the skeleton of a convex polyhedron.

The vertex-connectivity of an input graph G can be computed in polynomial time in the following way^[4] consider all possible pairs ${\displaystyle (s,t)}$ of nonadjacent nodes to disconnect, using Menger's theorem to justify that the minimal-size separator for ${\displaystyle (s,t)}$ is the number of pairwise vertex-independent paths between them, encode the input by doubling each vertex as an edge to reduce to a computation of the number of pairwise edge-independent paths, and compute the maximum number of such paths by computing the maximum flow in the graph between ${\displaystyle s}$ and ${\displaystyle t}$ with capacity 1 to each edge, noting that a flow of ${\displaystyle k}$ in this graph corresponds, by the integral flow theorem, to ${\displaystyle k}$ pairwise edge-independent paths from ${\displaystyle s}$ to ${\displaystyle t}$.

Let k≥2.

• Every ${\displaystyle k}$-connected graph of order at least ${\displaystyle 2k}$ contains a cycle of length at least ${\displaystyle 2k}$
• In a ${\displaystyle k}$-connected graph, any ${\displaystyle k}$ vertices in ${\displaystyle G}$ lie on a common cycle.^[5]

The cycle space of a ${\displaystyle 3}$-connected graph is generated by its non-separating induced cycles. ^[6]

A graph with at least ${\displaystyle 2k}$ vertices is called ${\displaystyle k}$-linked if there are ${\displaystyle k}$ disjoint paths for any sequences ${\displaystyle a_{1},\dots ,a_{k}}$ and ${\displaystyle b_{1},\dots ,b_{k}}$ of ${\displaystyle 2k}$ distinct vertices. Every ${\displaystyle k}$-linked graph is ${\displaystyle (2k-1)}$-connected graph, but not necessarily ${\displaystyle 2k}$-connected. ^[7]

If a graph is ${\displaystyle 2k}$-connected and has average degree of at least ${\displaystyle 16k}$, then it is ${\displaystyle k}$-linked. ^[8]

• k-edge-connected graph
• Connectivity (graph theory)
• Menger's theorem
• Structural cohesion
• Tutte embedding
• Vertex separator

• Diestel, Reinhard (2005), Graph Theory (3rd ed.), Berlin, New York: Springer-Verlag, ISBN 978-3-540-26183-4
• Diestel, Reinhard (2012), Graph Theory (corrected 4th electronic ed.)
• Diestel, Reinhard (2016), Graph Theory (5th ed.), Berlin, New York: Springer-Verlag, ISBN 978-3-662-53621-6