# edgeConnectivity -- computes the edge connectivity of a graph

## Synopsis

• Usage:
C = edgeConnectivity G
• Inputs:
• G, an instance of the type Graph,
• Outputs:
• C, an integer, the edge connectivity of a graph

## Description

The edge connectivity of a graph is the smallest amount of edges that need be removed from a graph to make it not connected. This corresponds to the size of the edge cuts. A not connected graph has edge connectivity equal to 0.

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

## Ways to use edgeConnectivity :

• "edgeConnectivity(Graph)"

## For the programmer

The object edgeConnectivity is .