On the distance preserving trees in graphs

TL;DR

This paper investigates the conditions under which a weighted graph admits a spanning tree that preserves distances from two distinct vertices, providing a characterization for such trees.

Contribution

It offers a novel characterization of weighted graphs that possess spanning trees preserving distances from two different vertices.

Findings

Characterization of graphs with distance-preserving spanning trees from two vertices

Conditions under which such spanning trees exist in weighted graphs

Insights into the structure of graphs supporting multiple distance-preserving trees

Abstract

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 from $v$ to $w$ on $G$. If two vertices $u$ and $v$ are distinct, then two distance-preserving spanning trees $T_{u}$ from $u$ and $T_{v}$ from $v$ are distinct in general. A purpose of this paper is to give a characterization for a given weighted graph $G$ to have a spanning tree $T$ such that $T$ is a distance-preserving spanning tree from distinct two vertices.