<< NARVAL_G_Connex NARVAL NARVAL_G_CoulombForce >>

NARVAL >> NARVAL > NARVAL_G_Coreness

NARVAL_G_Coreness

Perform the coreness vector of a graph.

Calling Sequence

[kc] = NARVAL_G_Coreness(g)

Parameters

g :

graph.

kc :

coreness vector.

Description

NARVAL_G_Coreness performs the coreness vector kc 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. The node coreness K of a given node is the maximum k such that this node is still present in the k-core, but removed in the k+1-core (WIKIPEDIA).

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
i=1;//window index
[f]=NARVAL_G_ShowGraph(g,1);//graph visualization
[kc]=NARVAL_G_Coreness(g);//application of NARVAL_G_Coreness 
kc

Dependency

NARVAL_G_GraphDegDistWD, NARVAL_G_kCore

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_Connex NARVAL NARVAL_G_CoulombForce >>