The detour hull number of a graph

• Дата: 2018
• Автори: Santhakumaran, A. P., Chandran, S. V. Ullas
• Формат: Стаття
• Мова: Англійська
• Опубліковано: Lugansk National Taras Shevchenko University 2018
• Теми: detour; detour convex set; detour number; detour extreme vertex; detour hull number; 05C12
• Онлайн доступ: https://admjournal.luguniv.edu.ua/index.php/adm/article/view/728
• Назва журналу: Algebra and Discrete Mathematics

For vertices \(u\) and \(v\) in a connected graph \(G=(V, E)\), the set \(I_D[u,v]\) consists of all those vertices lying on a \(u-v\) longest path in \(G\). Given a set \(S\) of vertices of \(G\), the union of all sets \(I_D[u,v]\) for \(u,v\in S\), is denoted by \(I_D[S]\). A set \(S\) is a detour...