Hardness results of global roman domination in graphs

Abstract

A Roman dominating function (RDF) of a graph G=(V,E) is a function f:V→{0,1,2} such that every vertex assigned the value 0 is adjacent to a vertex assigned the value 2. A global Roman dominating function (GRDF) of a graph G=(V,E) is a function f:V→{0,1,2} such that f is a Roman dominating function of both G and its complement G¯. The weight of f is f(V)=Σu∈Vf(u). The minimum weight of a GRDF in a graph G is known as global Roman domination number of G and is denoted by γgR(G). Minimum Global Roman Domination is to find a global Roman dominating function of minimum weight and Decide Global Roman Domination is the decision version of Minimum Global Roman Domination. In this paper, we show that Decide Global Roman Domination is NP-complete for bipartite graphs and chordal graphs. On the positive side, we give a polynomial-time algorithm for Minimum Global Roman Domination for threshold graphs. Further, we propose an O(ln|V|)-approximation algorithm for Minimum Global Roman Domination for a graph G=(V,E). We also show that Minimum Global Roman Domination cannot be approximated within a factor of (1−ϵ)ln|V| for any ϵ>0 unless P = NP. Next, we show that Minimum Global Roman Domination admits a constant approximation algorithm for bounded degree graphs. Finally, we show that Minimum Global Roman Domination is APX-complete for bounded degree graphs.