<< NL_G_JointDegreeDist NL_G: Graph NL_G_LoadGraph >>

NARVAL >> NL_G: Graph > NL_G_KCore

NL_G_KCore

Perform the k-core of a graph.

Calling Sequence

[Go,I] = NL_G_KCore(G,K)

Arguments

G :

Graph.

K :

Node degree.

:

Output graph.

I :

List of deleted nodes.

Description

NL_G_KCore performs the k-core of the graph G. The k-core of a graph is the subgraph obtained from the original graph after the removal of all nodes of degree (WIKIPEDIA). The list of deleted nodes is stored in I.

Examples

n=300;//network size
l0=5;//a maximum of 5 links are created for any created node
L=1000;//network square area side 
[g,dd]=NL_T_BarabasiAlbert(n,l0,L);//generation of the topology
i1=1;//window index
[f]=NL_G_ShowGraph(g,i1);//graph visualization
k=4;//core-level
[go,ind]=NL_G_KCore(g,k);//application of NL_G_KCore
go.name='NL_G_KCore'; 
ind
i2=2;//window index
[f2]=NL_G_ShowGraph(go,i2);//graph visualization

Dependency

NL_G_GraphDegreeDist, NL_G_DeleteNodes

Report an issue
<< NL_G_JointDegreeDist NL_G: Graph NL_G_LoadGraph >>