Let G be a graph which is connected. A monophonic dominating set M is said to be a secure monophonic dominating set Sm(written as SMD set) of G if for each g ∈ V \M there exists f ∈ M such that g is adjacent to f and Sm = ...