The upper edge-to-vertex detour number of a graph

• Published in: Algebra and Discrete Mathematics
• Date: 2012
• Main Authors: Santhakumaran, A.P., Athisayanathan, S.
• Format: Article
• Language: English
• Published: Інститут прикладної математики і механіки НАН України 2012
• Online Access: https://nasplib.isofts.kiev.ua/handle/123456789/152187
• Journal Title: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Cite this: The upper edge-to-vertex detour number of a graph / A.P. Santhakumaran, S. Athisayanathan // Algebra and Discrete Mathematics. — 2012. — Vol. 13, № 1. — С. 128–138. — Бібліогр.: 9 назв. — англ.

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, B) is defined as D(A, B) = min{D(x, y): x ∈ A, y ∈ B}. A u-v path of length D(...