# vertex connectivity

(definition)

**Definition:**
(1) The smallest number of *vertices* whose deletion causes a *connected graph* to not be connected. (2) For a pair of vertices s and t in a graph, the smallest number of vertices whose deletion will separate s from t.

**See also**
*edge connectivity*.

Author: GS

## Implementation

(Mathematica, C, and Pascal)

Go to the
Dictionary of Algorithms and Data
Structures home page.

If you have suggestions, corrections, or comments, please get in touch
with Paul Black.

Entry modified 2 September 2014.

HTML page formatted Mon Feb 2 13:10:40 2015.

Cite this as:

Gopinath Srinivasan, "vertex connectivity", in
*Dictionary of Algorithms and Data Structures* [online], Vreda Pieterse and Paul E. Black, eds. 2 September 2014. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/vertexConnectivity.html