The vertex detour hull number of a graph
A.P. Santhakumaran, S.V. Ullas Chandran (2012)
Discussiones Mathematicae Graph Theory
Similarity:
For vertices x and y in a connected graph G, the detour distance D(x,y) is the length of a longest x - y path in G. An x - y path of length D(x,y) is an x - y detour. The closed detour interval ID[x,y] consists of x,y, and all vertices lying on some x -y detour of G; while for S ⊆ V(G), . A set S of vertices is a detour convex set if . The detour convex hull is the smallest detour convex set containing S. The detour hull number dh(G) is the minimum cardinality among subsets S of...