# KVertexConnectedComponents

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:

 In[1]:=
 In[2]:=
 Out[2]=

Show the 2-connected components:

 In[3]:=
 Out[3]=

Find the 2-connected components in a social network:

 In[1]:=
 In[2]:=
 Out[2]=