Encyclopedia > K > K-vertex-connected graph
K-vertex-connected graph
In graph theory, a graph G with vertex set V(G) is said to be k-vertex-connected if G setminus X is connected for all X subseteq V(G) with left| X right| < k. In plain english, a graph is k-vertex-connected if the graph remains connected when you delete fewer than k vertices from the graph.
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)