KVertexConnectedComponents

KVertexConnectedComponents[g,k]

gives the k-vertex-connected components of the graph g.

KVertexConnectedComponents[g,k,{v1,v2,}]

gives the k-vertex-connected components that include at least one of the vertices v1, v2, .

Details

  • KVertexConnectedComponents is also known as k-connected components.
  • KVertexConnectedComponents 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-vertex-connected subgraph of g.
  • For an undirected graph, the vertices u and v are in the same component if there are at least k vertex-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 vertex-disjoint directed paths from u to v and from v to u.

Examples

open allclose all

Basic Examples  (2)

Find 2-connected components of a graph:

Show the 2-connected components:

Find the 2-connected components in a social network:

Scope  (4)

KVertexConnectedComponents works with undirected graphs:

Select 2-connected components that include at least one of the specified vertices:

Use patterns to select components:

Works with large graphs:

Applications  (1)

Highlight the k-connected components of a graph:

Properties & Relations  (1)

A k-vertex-connected graph has a k-vertex-connected component as itself:

Introduced in 2014
 (10.0)