A set S of vertices of a graph G is a monophonic set of G if each vertex u of G lies on an u ? v monophonic path in G for some u, v ? S. M ? V (G) is said to be a monophonic dominating set if it is both a monophonic set ...