Mean distances between graphs in several lineages.

For two lineages G1, G2… (listed at left) and H!, H2, … (listed at the top), each entry shows the mean distance D(Gi, Hi+1) (where the average is taken over i = 1 to 12). As expected, we see that the distance from elements of a graph lineage to other members of the same lineage (the diagonal entries of the table) is smaller than distances taken between lineages. Furthermore as expected, 1D paths are more similar (but not equal) to 1D cycles than to other graph lineages.