Fig. 5From: About complexity of complex networksAn example of the adjacency matrix design. A set of (16,4)-partitions 𝜗(16,4) (b), and its adjacency matrix for G(V𝜗(16,4),E4) (c). The red squares correspond to the adjacency matrix for G(V𝜗(9,3),E3). At each step (increasing in partition parts m on a unit basis), each adjacency matrix from the previous step becomes the central part of the new matrix for m+1Back to article page