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

• Дата: 2018
• Автори: Santhakumaran, A. P., Athisayanathan, S.
• Формат: Стаття
• Мова: English
• Опубліковано: Lugansk National Taras Shevchenko University 2018
• Теми: Detour; edge-to-vertex detour set; edge-to-vertex detour basis; edge-to-vertex detour number; upper edge-to-vertex detour number; 05C12
• Онлайн доступ: https://admjournal.luguniv.edu.ua/index.php/adm/article/view/697
• Назва журналу: Algebra and Discrete Mathematics

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...