Fig. 6 |. Graph similarity experiment.
Feature vectors corresponding to four different graphs, which are drawn next to their corresponding feature vectors. Negative-weighted edges are highlighted by thick red lines. The components of the vectors are probabilities for the orbits [1,1,1], [1,1,1,1] and [2,1,1,1], respectively. Feature vectors are also calculated for three random permutations of the graph. These appear as clusters of permutationally invariant graphs.