Figure 1
Isomorphic classes of wedges (a) and triangles (b) in directed graphs. In each wedge/triangle one vertex is labeled i (wedge/triangle starts at i). Assuming that directed (and reciprocal) edges are considered with respect to particular vertex in the wedge or the triangle (see the main text), each wedge and triangle can be labeled as (α, β) and (α, β, γ), respectively, where α, β, γ ∈ {+, −,∘}. Hence, there are 9 wedges and 27 triangles starting at i, which are clustered in 6 wedge isomorphic classes (a) and 7 triangle isomorphic classes (b). (c) Entries of adjacency matrix for out-, in-, and reciprocal-edges.
