m

n=m^{2}

n=m^{2}±1

n=m^{2}±2

n=m^{2}±3

n=m^{2}±4



Total

Global

Total

Global

Total

Global

Total

Global

Total

Global


nodes

overlap

nodes

overlap

nodes

overlap

nodes

overlap

nodes

overlap

2

—

0

7

0

9

0

9

0

—

—

3

7

2.57

19

2.63

13

2.46

12

2.0

—

—

4

19

3.57

51

3.56

39

3.23

27

3.18

—

—

5

51

4.90

141

4.77

111

4.43

81

4.22

50

4.0

6

141

6.53

393

6.38

321

5.96

241

5.65

182

5.45

7

393

8.72

1107

8.52

924

8.04

714

7.6

546

7.38

8

1107

11.62

3138

11.39

2674

10.79

2114

10.21

1646

9.92

 As in Table 1 the parameters MDenV(m) and MDenCl are calculated for graphs without head node. Number of nodes for the graphs G(DDPF(n,m)) and Global overlapping does not coincidence with graphs for progenitor DDPF(m^{2}). Total cliques numbers are the almost the same (2^{m} instead of 2^{m}−2) and the topological characteristics such as clustering coefficients, global efficiency,characteristic path length and graph density (exception is the nodes degrees distribution) for networks of Table 3 are practically indistinguishable from accordance characteristics in Table 1.