Seen from eqn. 4, term i of k (L) (G, G ) in eqn. 5 is the number of pairs of length-L walks-one in graph G, the other in graph G -with label sequence s i ∈ S L . So, k (L) (G, G ) sums counts of pairs of length-L walks on the two graphs G, G sharing a label sequence: