Fig. 6From: Establish the expected number of induced motifs on unlabeled graphs through analytical modelsCompressed AS containing all the possible 4-nodes non-isomorphic subgraphs. Edges are weighted by the number of occurrences of a subgraph that can be obtained from another subgraph by adding one edge in all possible waysBack to article page