Skip to main content

Table 1 The results of numerical calculation of the graph’s connectivity (parameters MDenV(m) and MDenCl are calculated for graphs without head nodes)

From: About complexity of complex networks

m |V| Node D(1) D(2) D(3) D(4) D(5) Md MdenG MdenCl Ov L Cc
3 7 Deg. 3 6 3.4 0.87 1.0 2.57 1.43 0.54
   Quant. 6 1       
4 19 Deg. 5 9 18 8.2 0.39 1.0 2.58 1.54 0.59
   Quant. 6 12 1       
5 51 Deg. 13 25 50 18.2 0.34 1.0 4.9 1.63 0.56
   Quant. 30 20 1       
6 141 Deg. 19 35 69 140 40.3 0.28 1.0 6.53 1.7 0.52
   Quant. 20 90 30 1       
7 393 Deg. 49 95 191 393 87.9 0.22 1.0 8.72 1.77 0.47
   Quant. 140 210 42 1       
8 1107 Deg. 69 132 261 533 1106 194.7 0.17 1.0 11.6 1.82 0.42
   Quant. 70 553 420 55 1       
9 3139 Deg. 181 357 752 1499 3138 437.4 0.14 1.0 15.5 1.86 0.37
   Quant. 630 1681 755 74 1       
  1. The following notation is used: D(j) is the index of specific vertexes degree, Cc(m) is the clustering coefficient, Md(m) is the average node degree, MDenCl(m) is the density of clique graph GC(V,E), Ov is the global overlapping index, and L is the characteristic path length.