The detour hull number of a graph

• Published in: Algebra and Discrete Mathematics
• Date: 2012
• Main Authors: Santhakumaran, A.P., Ullas Chandran, S.V.
• Format: Article
• Language: English
• Published: Інститут прикладної математики і механіки НАН України 2012
• Online Access: https://nasplib.isofts.kiev.ua/handle/123456789/152246
• Journal Title: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Cite this: The detour hull number of a graph / A.P. Santhakumaran, S.V. Ullas Chandran // Algebra and Discrete Mathematics. — 2012. — Vol. 14, № 2. — С. 307–322. — Бібліогр.: 14 назв. — англ.

For vertices u and v in a connected graph G = (V, E), the set ID[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 ID[u, v] for u, v ∈ S, is denoted by ID[S]. A set S is a detour convex set if ID[S] = S. The detour convex hul...