# KCoreComponents

KCoreComponents[g,k]

gives the k-core components of the underlying simple graph of g.

KCoreComponents[g,k,"In"]

gives the k-core components with vertex in-degrees at least k.

KCoreComponents[g,k,"Out"]

gives the k-core components with vertex out-degrees at least k.

KCoreComponents[{vw,},]

uses rules vw to specify the graph g.

# Details

• A k-core component is a maximal weakly connected subgraph in which all vertices have degree at least k.
• KCoreComponents returns a list of components {c1,c2,}, where each component ci is given as a list of vertices.
• For a directed graph g, KCoreComponents[g,k] gives the k-core components of the underlying undirected simple graph of g.
• KCoreComponents works with undirected graphs, directed graphs, multigraphs, and mixed graphs.

# Examples

open allclose all

## Basic Examples(2)

Find the 3-core components of a graph:

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

Show the 3-core components:

 In[3]:=
 Out[3]=

Find the 4-core components in a social network:

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