1 Answers
A tree k-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 k {\displaystyle k} times their distance in G {\displaystyle G}.
4 views
Answered