$1$-MOVABLE CLIQUE DOMINATING SETS OF A GRAPH
Teffany V. Daniel, Sergio R. Canoy, Sergio R. Canoy · International Journal of Pure and Apllied Mathematics · 2016
A clique (convex) dominating set S of G is a 1-movable clique dominating set (resp.1-movable convex dominating set) of G if for every v ∈ S, either S \ {v} is a clique (resp.convex) dominating set or there exists a vertex u ∈This paper aims to characterize the 1-movable clique dominating sets of some graphs including those resulting from the join and composition of two graphs.The corresponding 1-movable clique domination number of the resulting graph is then determined.Further, it is shown that the concepts of 1-movable clique domination and 1-movable convex domination are equivalent.