For a connected graph G = (V, E) of order at least two, a restrained monophonic set S of a graph G is a monophonic set such that either S = V or the subgraph induced by V ?S has no isolated vertices. The minimum cardinality ...