On the distance preserving trees in graphs

Toru Araki, Shingo Osawa, Takashi Shimizu

For a vertex $v$ of a graph $G$, a spanning tree $T$ of $G$ is distance-preserving from $v$ if, for any vertex $w$, the distance from $v$ to $w$ on $T$ is the same as the distance…