Majority domination in graphs Original Research Article

A two-valued function f defined on the vertices of a graph G = (V, E), f: V → -1, 1, is a majority dominating function if the sum of its function values over at least half the closed neighborhoods is at least one. That is, for at least half the vertices v ϵ V, f(N[v]) ⩾ 1, where N[v] consists of v and every vertex adjacent to v. The weight of a majority dominating function is f(V) = ∑f(v), over all vertices v ϵ V. The majority domination number of a graph G, denoted γmaj(G), equals the minimum weight of a majority dominating function of G. In this paper we present properties of the majority domination number and establish its value for various classes of graphs. We show that the decision problem corresponding to the problem of computing γmaj(G) is NP-complete.