Disconnected Multi-Effect Domination in Graphs
Asia Pacific Journal of Mathematics · 2024
A. In this paper, disconnected multi-effect domination, a novel domination model in graphs is introduced.Let G = (V, E) be a finite, nontrivial, simple, and undirected graph without isolatedThe minimum cardinality over all disconnected multi-effect dominating sets in G is the disconnected multi-effect domination number of G denoted by γ dm (G).Some bounds and properties of disconnected multi-effect domination are studied with respect to order, size, minimum degree, and the maximum degree of a graph.A disconnected multi-effect domination number is determined for a recognized graphs.