Abstract A dominating set is said to be a congruent dominating set of a graph if .
The minimum cardinality of a minimal congruent dominating set of is called the congruent domination number of which is
denoted by . In this paper, we investigate congruent domination number of some graphs obtained by means of some graph
operation.
