Algorithmic Aspects of Quasi-Total Roman Domination in Graphs

Abstract

For a simple, undirected, connected graph G=(V,E), a function f : V(G) →{0, 1, 2} which satisfies the following conditions is called a quasi-total Roman dominating function (QTRDF) of G with weight f(V(G))=ΣvEV(G) f(v).C1). Every vertex ueV for which f(u) = 0 must be adjacent to at least one vertex v with f(v) = 2, and C2). Every vertex ueV for which f(u) = 2 must be adjacent to at least one vertex v with f(v)≥1. For a graph G, the smallest possible weight of a QTRDF of G denoted γqtR(G) is known as the quasi-total Roman domination number of G. The problem of determining γqtR(G) of a graph G is called minimum quasi-total Roman domination problem (MQTRDP). In this paper, we show that the problem of determining whether G has a QTRDF of weight at most l is NP-complete for split graphs, star convex bipartite graphs, comb convex bipartite graphs and planar graphs. On the positive side, we show that MQTRDP for threshold graphs, chain graphs and bounded treewidth graphs is linear time solvable. Finally, an integer linear programming formulation for MQTRDP is presented.