A tree t {\displaystyle t} -spanner of a graph G {\displaystyle G} is a spanning subtree T {\displaystyle T} of G {\displaystyle G} in which the distance between every pair of vertices is at most t {\displaystyle t} times their distance in G {\displaystyle G} .
