Algorithmic results on double Roman domination in graphs

S. Banerjee (), Michael A. Henning () and D. Pradhan ()
Additional contact information
S. Banerjee: Indian Institute of Technology (ISM)
Michael A. Henning: University of Johannesburg
D. Pradhan: Indian Institute of Technology (ISM)

Journal of Combinatorial Optimization, 2020, vol. 39, issue 1, No 7, 90-114

Abstract: Abstract Given a graph $$G=(V,E)$$G=(V,E), a function $$f:V\longrightarrow \{0,1,2,3\}$$f:V⟶{0,1,2,3} is called a double Roman dominating function on G if (i) for every $$v\in V$$v∈V with $$f(v)=0$$f(v)=0, there are at least two neighbors of v that are assigned 2 under f or at least a neighbor of v that is assigned 3 under f, and (ii) for every vertex v with $$f(v)=1$$f(v)=1, there is at least one neighbor w of v with $$f(w)\ge 2$$f(w)≥2. The weight of a double Roman dominating function f is $$f(V)=\sum _{u\in V}f(u)$$f(V)=∑u∈Vf(u). The double Roman domination number of G, denoted by $$\gamma _{dR}(G)$$γdR(G) is the minimum weight of a double Roman dominating function on G. For a graph $$G=(V,E)$$G=(V,E), Min-Double-RDF is to find a double Roman dominating function f with $$f(V)=\gamma _{dR}(G)$$f(V)=γdR(G). The decision version of Min-Double-RDF is shown to be NP-complete for chordal graphs and bipartite graphs. In this paper, we first strengthen the known NP-completeness of the decision version of Min-Double-RDF by showing that the decision version of Min-Double-RDF remains NP-complete for undirected path graphs, chordal bipartite graphs, and circle graphs. We then present linear time algorithms for computing the double Roman domination number in proper interval graphs and block graphs. We then discuss on the approximability of Min-Double-RDF and present a 2-approximation algorithm in 3-regular bipartite graphs.

Keywords: Domination; Roman domination; Double Roman domination; Polynomial time algorithm; NP-complete (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00457-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:39:y:2020:i:1:d:10.1007_s10878-019-00457-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00457-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().