For a connected graph G = (V, E) of order at least two, a connected detour monophonic set S of G is called a minimal connected detour monophonic set if no proper subset of S is a connected detour monophonic set of G. The ...