A geodetic (resp. monophonic) dominating set in a connected graph \(G \) is any set of vertices of \(G\) which is both a geodetic (resp.monophonic) set and a dominating set in \(G\). This paper establishes some relationships between geodetic domination and monophonic domination in a graph. It also investigates the geodetic domination and monophonic domination in the join, corona and composition of
connected graphs.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.