k-vertex-connected graph
Graph which remains connected when k or fewer nodes removed / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about K-vertex-connected graph?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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.