Relating 2-Rainbow Domination To Roman Domination

Open access

Abstract

For a graph G, let R(G) and yr2(G) denote the Roman domination number of G and the 2-rainbow domination number of G, respectively. It is known that yr2(G) ≤ R(G) ≤ 3/2yr2(G). Fujita and Furuya [Difference between 2-rainbow domination and Roman domination in graphs, Discrete Appl. Math. 161 (2013) 806-812] present some kind of characterization of the graphs G for which R(G) − yr2(G) = k for some integer k. Unfortunately, their result does not lead to an algorithm that allows to recognize these graphs efficiently. We show that for every fixed non-negative integer k, the recognition of the connected K4-free graphs G with yR(G) − yr2(G) = k is NP-hard, which implies that there is most likely no good characterization of these graphs. We characterize the graphs G such that yr2(H) = yR(H) for every induced subgraph H of G, and collect several properties of the graphs G with R(G) = 3/2yr2(G).

[1] J.D. Alvarado, S. Dantas and D. Rautenbach, Averaging 2-rainbow domination and Roman domination, Discrete Appl. Math. 205 (2016) 202-207. doi:

[2] J.D. Alvarado, S. Dantas and D. Rautenbach, Relating 2-rainbow domination to weak Roman domination, arXiv:1507.04899.

[3] B. Breˇsar, M.A. Henning and D.F. Rall, Rainbow domination in graphs, Taiwanese J. Math. 12 (2008) 213-225.

[4] M. Chellali, T.W. Haynes and S.T. Hedetniemi, Bounds on weak roman and 2- rainbow domination numbers, Discrete Appl. Math. 178 (2014) 27-32. doi:

[5] M. Chellali and N.J. Rad, On 2-rainbow domination and Roman domination in graphs, Australas. J. Combin. 56 (2013) 85-93.

[6] S. Fujita and M. Furuya, Difference between 2-rainbow domination and Roman dom- ination in graphs, Discrete Appl. Math. 161 (2013) 806-812. doi:

[7] I. Stewart, Defend the Roman empire!, Sci. Amer. 281 (1999) 136-139. doi:

[8] Y. Wu and N.J. Rad, Bounds on the 2-rainbow domination number of graphs, arXiv:1005.0988v1.

[9] Y. Wu and H. Xing, Note on 2-rainbow domination and Roman domination in graphs, Appl. Math. Lett. 23 (2010) 706-709. doi:

Discussiones Mathematicae Graph Theory

The Journal of University of Zielona Góra

Journal Information


IMPACT FACTOR 2017: 0.601
5-year IMPACT FACTOR: 0.535



CiteScore 2018: 0.73

SCImago Journal Rank (SJR) 2018: 0.763
Source Normalized Impact per Paper (SNIP) 2018: 0.934

Mathematical Citation Quotient (MCQ) 2017: 0.36

Target Group

researchers in the fields of: colourings, partitions (general colourings), hereditary properties, independence and dominating structures (sets, paths, cycles, etc.), cycles, local properties, products of graphs

Metrics

All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 164 151 11
PDF Downloads 81 74 4