<< NARVAL_G_GraphDegDist NARVAL NARVAL_G_GraphInit >>

NARVAL >> NARVAL > NARVAL_G_GraphDegDistWD

NARVAL_G_GraphDegDistWD

Perform the node degree distribution of a graph (Without Display).

Calling Sequence

[d,dv] = GraphDegDistWD(g)

Parameters

g :

network graph.

d :

node degree distribution.

dv :

node degree vector.

Description

NARVAL_G_GraphDegDistWD performs the node degree distribution d of the graph g. The degree of each network node is stored in dv.

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,d]=NARVAL_T_BarabasiAlbert(n,l0,L);//generation of the topology
ind=1;//window index
[f]=NARVAL_G_ShowGraph(g,ind);//graph visualization
[d,dv]=NARVAL_G_GraphDegDistWD(g);//application of NARVAL_G_GraphDegDistWD
d
dv

Dependency

NARVAL_G_NodeNeighbors

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_GraphDegDist NARVAL NARVAL_G_GraphInit >>