Edge connectivity
≈ 3 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In graph theory, a connected graph is -edge-connected if it remains connected whenever fewer than edges are removed. The edge-connectivity of a graph is the largest for which the graph is -edge-connected. Edge connectivity and the enumeration of -edge-connected graphs was studied by Camille Jordan in 1869.
In graph theory, a connected graph is -edge-connected if it remains connected whenever fewer than edges are removed. The edge-connectivity of a graph is the largest for which the graph is -edge-connected. Edge connectivity and the enumeration of -edge-connected graphs was studied by Camille Jordan in 1869.
Formal definition
Let G = (V, E) be an arbitrary graph. If the subgraph G' = (V, E \setminus X) is connected for all X \subseteq E where |X| , then G is said to be k-edge-connected. The edge connectivity of G is the maximum value k such that G is k-edge-connected. The smallest set X whose removal disconnects G is a minimum cut in G. The edge connectivity version of Menger's theorem provides an alternative and equivalent characterization, in terms of edge-disjoint paths in the graph. If and only if every two vertices of G form the endpoints of k paths, no two of which share an edge with each other, then G is k-edge-connected. In one direction this is easy: if a system of paths like this exists, then every set X of fewer than k edges is disjoint from at least one of the paths, and the pair of vertices remains connected to each other even after X is deleted. In the other direction, the existence of a system of paths for each pair of vertices in a graph that cannot be disconnected by the removal of few edges can be proven using the max-flow min-cut theorem from the theory of network flows.
Related concepts
Minimum vertex degree gives a trivial upper bound on edge-connectivity. That is, if a graph G = (V, E) is k-edge-connected then it is necessary that k ≤ δ(G), where δ(G) is the minimum degree of any vertex v ∈ V. Deleting all edges incident to a vertex v would disconnect v from the graph. Edge connectivity is the dual concept to girth, the length of the shortest cycle in a graph, in the sense that the girth of a planar graph is the edge connectivity of its dual graph, and vice versa. These concepts are unified in matroid theory by the girth of a matroid, the size of the smallest dependent set in the matroid. For a graphic matroid, the matroid girth equals the girth of the underlying graph, while for a co-graphic matroid it equals the edge connectivity. The 2-edge-connected graphs can also be characterized by the absence of bridges, by the existence of an ear decomposition, or by Robbins' theorem according to which these are exactly the graphs that have a strong orientation. By a corollary of the Nash-Williams theorem, the edge-connectivity of a graph provides bounds on how many edge-disjoint spanning trees can be found within the graph.
References
Text derived from https://en.wikipedia.org/w/index.php?oldid=1363592878 under CC BY-SA 4.0; modifications have been made.