In order to investigate the representation capabilities of different geometric spaces, synthetic graphs have been used [1]}, [2]}. So far the attention was mainly on graphs with pure geometric features, such as grids or trees, or their Cartesian products.
We propose to expand the set of synthetic benchmarking graphs by rooted products of graphs.
