Isometric-Universal Graphs for Trees

Edgar Baucher, François Dross, Cyril Gavoille

We consider the problem of finding the smallest graph that contains two input trees each with at most $n$ vertices preserving their distances. In other words, we look for an isomet…