Disconnected Multi-Effect Domination for Several Graphs Constructed by Corona Operation

In this paper, disconnected multi-effect domination is discussed, a new domination model in graphs is introduced . Let is a finite, simple, nontrivial, and undirected graph without isolated vertex. A dominating subset is a disconnected multi-effect dominating set in if for every vertex , ((2and is disconnected subgraph. The minimum cardinality over all disconnected multi-effect dominating sets in is the disconnected multi-effect domination number of denoted by . In this work some graphs generated by corona operation will be studied.