Algorithms and Complexity of Signed, Minus, and Majority Domination

A signed dominating function on a graph G = (V, E) is a function f : V →{−1, 1} satisfying the condition that for every vertex v ∈ V , the sum of the values assigned to v and all neighbors of v is at least 1, denoted f(N[v]) ≥ 1.