VertexConnectivity
gives the vertex connectivity of the graph g.
VertexConnectivity[g,s,t]
gives the s-t vertex connectivity of the graph g.
VertexConnectivity[{vw,…},…]
uses rules vw to specify the graph g.
Details

- VertexConnectivity is also known as connectivity or point connectivity.
- The vertex connectivity of a graph g is the smallest number of vertices whose deletion from g either disconnects g or reduces it to a single vertex graph.
- The s-t vertex connectivity is the smallest number of vertices whose deletion from g disconnects g with s and t in two different connected components.
- For a disconnected graph, VertexConnectivity will return 0.
- VertexConnectivity works with undirected graphs, directed graphs, multigraphs, and mixed graphs.

Examples
open allclose allScope (6)
VertexConnectivity works on undirected graphs:
Use rules to specify the graph:
VertexConnectivity works on large graphs:
Properties & Relations (2)
Text
Wolfram Research (2012), VertexConnectivity, Wolfram Language function, https://reference.wolfram.com/language/ref/VertexConnectivity.html (updated 2015).
CMS
Wolfram Language. 2012. "VertexConnectivity." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/VertexConnectivity.html.
APA
Wolfram Language. (2012). VertexConnectivity. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/VertexConnectivity.html