< Back to Article

Graph diffusion distance: Properties and efficient computation

Fig 6

Distances D²(G, H) calculated for several pairs of graphs.

The top plot shows distances where G and H are both chosen from {Grid_13×13, P₁₆₉, C₁₆₉, Ba₁₃}. At bottom, distances are calculated from G chosen in {Grid_12×12, P₁₄₄, C₁₄₄, Ba₁₂} to H chosen in {Grid_13×13, P₁₆₉, C₁₆₉, Ba₁₃}. As expected, diagonal entries are smallest.

doi: https://doi.org/10.1371/journal.pone.0249624.g006