Algorithmic and complexity aspects of problems related to total Roman domination for graphs

Abolfazl Poureidi () and Nader Jafari Rad ()
Additional contact information
Abolfazl Poureidi: Shahrood University of Technology
Nader Jafari Rad: Shahed University

Journal of Combinatorial Optimization, 2020, vol. 39, issue 3, No 6, 747-763

Abstract: Abstract A function $$f:V(G)\rightarrow \{0,1,2\}$$f:V(G)→{0,1,2} is a Roman dominating function (RDF) if every vertex u for which $$f(u)=0$$f(u)=0 is adjacent to at least one vertex v for which $$f(v)=2$$f(v)=2. The weight of a Roman dominating function is the value $$f(V(G))=\sum _{u \in V}f(u)$$f(V(G))=∑u∈Vf(u). The Roman domination number of a graph G, denoted by $$\gamma _{R}(G)$$γR(G), is the minimum weight of a Roman dominating function on G. A connected (respectively, total) Roman dominating function is an RDF f such that the vertices with non-zero labels under f induce a connected graph (respectively, a subgraph with no isolated vertex). The connected (respectively, total) Roman domination number of a graph G, denoted by $$\gamma _{cR}(G)$$γcR(G) (respectively, $$\gamma _{tR}(G)$$γtR(G)) is the minimum weight of a connected (respectively, total) RDF of G. It this paper we first study the complexity issue of the problems posed in [H. Abdollahzadeh Ahangar, M. A. Henning, V. Samodivkin and I. G. Yero, Total Roman domination in graphs, Appl. Anal. Discret. Math. 10 (2016), 501–517], and show that the problem of deciding whether $$\gamma _{tR}(G)=2\gamma (G)$$γtR(G)=2γ(G), $$\gamma _{tR}(G)=2\gamma _t(G)$$γtR(G)=2γt(G) or $$\gamma _{tR}(G)=3\gamma (G)$$γtR(G)=3γ(G) is NP-hard even when restricted to chordal or bipartite graphs. Then, we give a linear algorithm that decides whether $$\gamma _{tR}(G)=2\gamma (G)$$γtR(G)=2γ(G), $$\gamma _{tR}(G)=2\gamma _t(G)$$γtR(G)=2γt(G) or $$\gamma _{tR}(G)=3\gamma (G)$$γtR(G)=3γ(G), if G is a tree or a unicyclic graph.

Keywords: Dominating set; Total dominating set; Total Roman dominating function; Algorithm; 3-SAT (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00514-x 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:3:d:10.1007_s10878-019-00514-x

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

DOI: 10.1007/s10878-019-00514-x

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 ().