Macaulay2 » Documentation
Packages » Graphs :: edgeConnectivity
next | previous | forward | backward | up | index | toc

# edgeConnectivity -- computes the edge connectivity of a graph

- Usage:
    `C = edgeConnectivity G`
- Inputs:
  - G, a 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

## See also

- edgeCuts -- returns the edge cuts of a graph
- vertexConnectivity -- computes the vertex connectivity of a graph

## Ways to use edgeConnectivity:

- `edgeConnectivity(Graph)`

## For the programmer

The object edgeConnectivity is a method function.

The source of this document is in /build/macaulay2-88fgJW/macaulay2-1.25.11+ds/M2/Macaulay2/packages/Graphs.m2:2883:0.