Definition: (1) The smallest number of edges whose deletion will cause a connected graph to not be connected. (2) For a pair of vertices s and t in a graph, the smallest number of edges whose deletion will separate s from t.
See also vertex connectivity.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 12 August 2019.
HTML page formatted Mon Aug 12 09:59:40 2019.
Cite this as:
Gopinath Srinivasan, "edge connectivity", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 August 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/edgeConnectivity.html