FORCING SUPER DOMINATION NUMBER OF A GRAPH
Let be a simple graph and let A vertex is an external private neighbor of with respect to X if A set is a dominating set if every vertex is adjacent to at least one vertex of S. A dominating set S of G is a super dominating set if every vertex has an external private neighbor with respect to The super domination number of G, denoted by is the minimum cardinality of a super dominating set in G. A super dominating set S of G with is called a -set of G. A subset D of a -set is a forcing subset for S if S is the only -set of G containing D. The forcing super domination number of S is given by The forcing super domination number of G is given by
In this paper, we determine the super domination number of some common graphs and the join of some graphs.
domination, super domination, forcing domination, forcing super domination, join.