 That is, for each graph formula_128 we can compare the number of copies of formula_128 in formula_59 and formula_128 in formula_127.If these numbers are close for every graph formula_128, then
intuitively formula_59 and formula_127 are similar looking graphs.Rather than dealing directly with subgraphs, it turns out to be
easier to work with graph homomorphisms.