<< NL_G_ConnexComponent NL_G: Graph NL_G_CoulombForce >>

NARVAL >> NL_G: Graph > NL_G_Coreness

NL_G_Coreness

Perform the coreness vector of a graph.

Calling Sequence

[Kc] = NL_G_Coreness(G)

Arguments

G :

Graph.

:

Coreness vector.

Description

NL_G_Coreness performs the coreness vector 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 . The node coreness 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]=NL_T_BarabasiAlbert(n,l0,L);//generation of the topology
i=1;//window index
[f]=NL_G_ShowGraph(g,1);//graph visualization
[kc]=NL_G_Coreness(g)//application of NL_G_Coreness

Dependency

NL_G_GraphDegreeDist, NL_G_KCore

Report an issue
<< NL_G_ConnexComponent NL_G: Graph NL_G_CoulombForce >>