For a simple, undirected and connected graph G = (V,E), a total Roman dominating function (TRDF) f : V → {0,1,2} has the property that, every vertex u with f(u) = 0 is adjacent to at least one vertex v for which f(ⅴ) = 2 and the subgraph induced by the set of vertices labeled one or two has no isolated vertices. A total double Roman dominating function (TDRDF) on G is a function f : V → {0,1,2,3} such that for every vertex v ∈ V if f(ⅴ) = 0, then v has at least two neighbors x, y with f(ⅹ) = f(y) = 2 or one neighbor w with f(w) = 3, and if f(ⅴ) = 1, then v must have at least one neighbor w with f(w) ≥ 2 and the subgraph induced by the set {ui ∶ f(ui)≥ 1} has no isolated vertices. The weight of a T(D)RDF f is the sum f(Ⅴ) = Σ_v∈Vf(ⅴ). The minimum total (double) Roman domination problem (MT(D)RDP) is to find a T(D)RDF of minimum weight of the input graph. In this article, we show that MTRDP and MTDRDP are polynomial time solvable for bounded treewidth graphs, chain graphs and threshold graphs. We design a 2(ln(Δ - 0.5) + 1.5)-approximation algorithm (APX-AL) for the MTRDP and 3(ln(Δ - 0.5) + 1.5)-APX-AL for the MTDRDP, where Δ is the maximum degree of G, and show that the same cannot have (1 - δ) ln |V| ratio APX-AL for any δ > 0 unless P = NP. Finally, we show that MT(D)RDP is APX-hard for graphs with Δ = 5.
展开▼
