vertexConnectivity -- computes the vertex connectivity of a graph

Synopsis

Usage:

C = vertexConnectivity G
Inputs:
- G, a graph,
Outputs:
- C, an integer, the vertex connectivity of a graph

Description

The vertex connectivity of a graph is the smallest amount of vertices that need be removed from a graph to make it not connected or have one vertex. This corresponds to the size of the smallest vertex cut. A not connected graph has connectivity equal to 0.

i1 : G = graph({{1,2},{2,3},{3,1},{3,4},{4,5},{5,3}},EntryMode=>"edges");

i2 : vertexConnectivity G

o2 = 1

Ways to use vertexConnectivity :

vertexConnectivity(Graph)

For the programmer

The object vertexConnectivity is a method function.

vertexConnectivity -- computes the vertex connectivity of a graph

Synopsis

Description

See also

Ways to use vertexConnectivity :

For the programmer