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

edgeConnectivity -- computes the edge connectivity of a graph



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

Ways to use edgeConnectivity :

For the programmer

The object edgeConnectivity is a method function.