KEdgeConnectedComponents
gives the k-edge-connected components of the graph g.
KEdgeConnectedComponents[g,k,{v1,v2,…}]
gives the k-edge-connected components that include at least one of the vertices v1, v2, ….
KEdgeConnectedComponents[{vw,…},…]
uses rules vw to specify the graph g.
Details
- KEdgeConnectedComponents is also known as k-edge components.
- KEdgeConnectedComponents returns a list of components {c1,c2,…}, where each component ci is given as a list of vertices.
- The component ci generates a maximal k-edge-connected subgraph of g.
- For an undirected graph, the vertices u and v are in the same component if there are at least k edge-disjoint paths from u to v.
- For a directed graph, the vertices u and v are in the same component if there are at least k edge-disjoint directed paths from u to v and from v to u.
Examples
open allclose allBasic Examples (2)
Scope (8)
KEdgeConnectedComponents works with undirected graphs:
Select 3-edge-connected components that include at least one of the specified vertices:
Use rules to specify the graph:
Text
Wolfram Research (2014), KEdgeConnectedComponents, Wolfram Language function, https://reference.wolfram.com/language/ref/KEdgeConnectedComponents.html (updated 2015).
CMS
Wolfram Language. 2014. "KEdgeConnectedComponents." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/KEdgeConnectedComponents.html.
APA
Wolfram Language. (2014). KEdgeConnectedComponents. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/KEdgeConnectedComponents.html