FORCING DOMINATION NUMBERS OF GRAPHS UNDER SOME BINARY OPERATIONS
In this paper, we characterize the dominating sets in the join, corona and composition (lexicographic product) of two graphs. Further, we determine the domination number and the forcing domination number of each of these graphs.
domination, forcing domination, join, corona, composition.