Abstract
For a simple, undirected graph [Formula: see text] without isolated vertices, a function [Formula: see text] which satisfies the following two conditions is called a total 2-rainbow dominating function (T2RDF) of [Formula: see text]. (i) For all [Formula: see text], if [Formula: see text] then [Formula: see text] and (ii) Every [Formula: see text] with [Formula: see text] is adjacent to a vertex [Formula: see text] with [Formula: see text]. The weight of a T2RDF [Formula: see text] of [Formula: see text] is the value [Formula: see text]. The total 2-rainbow domination number is the minimum weight of a T2RDF on [Formula: see text] and is denoted by [Formula: see text]. The minimum total 2-rainbow domination problem (MT2RDP) is to find a T2RDF of minimum weight in the input graph. In this article, we show that the problem of deciding if [Formula: see text] has a T2RDF of weight at most [Formula: see text] for star convex bipartite graphs, comb convex bipartite graphs, split graphs and planar graphs is NP-complete. On the positive side, we show that MT2RDP is linear time solvable for threshold graphs, chain graphs and bounded tree-width graphs. On the approximation point of view, we show that MT2RDP cannot be approximated within [Formula: see text] for any [Formula: see text] unless [Formula: see text] and also propose [Formula: see text]-approximation algorithm for it. Further, we show that MT2RDP is APX-complete for graphs with maximum degree 4. Next, it is shown that domination problem and the total 2-rainbow domination problems are not equivalent in computational complexity aspects. Finally, an integer linear programming formulation for MT2RDP is presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have