variation, the connectivity of a complete graph is .

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 . This definition produces the same answer, n − 1, for the connectivity of the complete graph K_n.

A k-connected graph is by definition connected;

1.Previous
3.Next