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

## Bibliography

## References

“K-Vertex-Connected Graph.” 2023. In

*Wikipedia*. https://en.wikipedia.org/w/index.php?title=K-vertex-connected_graph&oldid=1151236919.