Fig. 7
From: Establish the expected number of induced motifs on unlabeled graphs through analytical models
TIAS \(\mathcal {T}'\) of the 4-nodes path m with an example of computation of the number of non-redundant occurrences of the 4-nodes square with diagonal m′ (the subgraph surrounded by a green circle) generated from m. There are two paths P1 and P2 between m and m′. P1 has weight 2, equal to the product of the weights of its edges (1 and 2). Likewise, P2 has weight 4, given by the product of the weights of its edges (2 and 2). The total number of occurrences of m′ generated from m is the sum of the weights of P1 and P2, i.e. 6. The final number of non-redundant occurrences of m′ generated from m is 6/2!=3, where 2 is the level of m′ in \(\mathcal {T}'\)