1-MOVABLE 2-PERFECT DOMINATING SET IN GRAPHS
A nonempty subset S of is a 1-movable 2-perfect dominating set of G if and for every is 2-perfect dominating set of G or is a 2-perfect dominating set of G and for every there exists such that is a 2-perfect dominating set of G. The cardinality of the smallest 1-movable 2-perfect dominating set of G is called 1-movable 2-perfect domination number of G, denoted by A 1-movable 2-perfect dominating set of G with cardinality equal to is called -set of G. This paper characterizes of the 1-movable 2-perfect dominating sets in the join and corona of two connected graphs.
domination, 2-perfect domination, 1-movable domination, 1-movable 2-perfect domination.