Santhakumaran, A.P.; Athisayanathan, S.
(Algebra and Discrete Mathematics, 2012)
For two vertices u and v in a graph G = (V, E), the detour distance D(u, v) is the length of a longest u-v path in G. A u-v path of length D(u, v) is called a u-v detour. For subsets A and B of V, the detour distance D(A, ...