The connected forcing connected vertex detour number of a graph
A. P. Santhakumaran, P. Titus · Discussiones Mathematicae Graph Theory · 2011
For any vertex x in a connected graph G of order p � 2, a set S of vertices of V is an x-detour set of G if each vertex v in G lies on an x-y detour for some element y in S. A connected x-detour set of G is an x-detour set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected x-detour set of G is the connected x-detour number of G and is denoted by cdx(G). For