Get Math Help

K-edge-connected Graph

Alternate name

Definition

A graph is k-edge-connected if there does not exist a set of k - 1 edges whose removal disconnects the graph. The maximum edge connectivity of a given graph is the smallest degree of any node, since deleting these edges disconnects the graph. Complete bipartite graphs have maximum edge connectivity. k-edge-connectedness graph checking is implemented in the Wolfram Language as KEdgeConnectedGraphQ[g, k]. The following table gives the numbers of k-edge-connected graphs for n-node graphs.

Related Wolfram Language symbol

KEdgeConnectedGraphQ

Why Club Z!?

We're Awesome!

Vestibulum vitae aliquam nunc. Suspendisse mollis metus ac tellus egestas pharetra. Suspendisse at viverra purus. Pellentesque nec posuere ligula, eu congue leo. Integer vulputate tempor arcu. Vestibulum vulputate Vestibulum vitae aliquam nunc. Suspendisse mollis metus ac tellus egestas pharetra. Suspendisse at viverra purus. Pellentesque nec posuere ligula, eu congue leo. Integer vulputate tempor arcu. Vestibulum vulputate

We're Awesome!

Vestibulum vitae aliquam nunc. Suspendisse mollis metus ac tellus egestas pharetra. Suspendisse at viverra purus. Pellentesque nec posuere ligula, eu congue leo. Integer vulputate tempor arcu.