<< NARVAL_G_WCirclePlace NARVAL NARVAL_IP_ClosingW >>

NARVAL >> NARVAL > NARVAL_G_kCore

NARVAL_G_kCore

Perform the k-core of a graph.

Calling Sequence

[go,ind] = NARVAL_G_kCore(g,k)

Parameters

g :

graph.

k :

node degree.

go :

output graph.

ind :

list of deleted nodes.

Description

NARVAL_G_kCore performs the k-core go 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 d<=k (WIKIPEDIA). The list of deleted nodes is stored in ind.

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]=NARVAL_T_BarabasiAlbert(n,l0,L);//generation of the topology
i1=1;//window index
[f]=NARVAL_G_ShowGraph(g,i1);//graph visualization
k=4;//core-level
[go,ind]=NARVAL_G_kCore(g,k);//application of NARVAL_G_kCore 
i2=2;//window index
[f2]=NARVAL_G_ShowGraph(go,i2);//graph visualization
ind

Dependency

NARVAL_G_GraphDegDistWD, NARVAL_G_DeleteNodes

Authors

Foued Melakessou

Contact

Dr. Foued Melakessou

Research Associate

Interdisciplinary Centre for Security, Reliability and Trust

Room F106

University of Luxembourg

6, rue Coudenhove Kalergi

L-1359 Luxembourg-Kirchberg

E-mail: foued.melakessou@uni.lu

Tel: (+352) 46 66 44 5346

Home Page


<< NARVAL_G_WCirclePlace NARVAL NARVAL_IP_ClosingW >>