Advertisement

Journal of Combinatorial Optimization

, Volume 36, Issue 1, pp 81–89 | Cite as

An upper bound on the double Roman domination number

  • J. Amjadi
  • S. Nazari-Moghaddam
  • S. M. Sheikholeslami
  • L. Volkmann
Article
  • 89 Downloads

Abstract

A double Roman dominating function (DRDF) on a graph \(G=(V,E)\) is a function \(f : V \rightarrow \{0, 1, 2, 3\}\) having the property that if \(f(v) = 0\), then vertex v must have at least two neighbors assigned 2 under f or one neighbor w with \(f(w)=3\), and if \(f(v)=1\), then vertex v must have at least one neighbor w with \(f(w)\ge 2\). The weight of a DRDF f is the value \(f(V) = \sum _{u \in V}f(u)\). The double Roman domination number \(\gamma _{dR}(G)\) of a graph G is the minimum weight of a DRDF on G. Beeler et al. (Discrete Appl Math 211:23–29, 2016) observed that every connected graph G having minimum degree at least two satisfies the inequality \(\gamma _{dR}(G)\le \frac{6n}{5}\) and posed the question whether this bound can be improved. In this paper, we settle the question and prove that for any connected graph G of order n with minimum degree at least two, \(\gamma _{dR}(G)\le \frac{8n}{7}\).

Keywords

Double Roman domination number Roman domination Domination 

References

  1. Abdollahzadeh Ahangar H, Amjadi J, Atapour M, Chellali M, Sheikholeslami SM (2017a) Double Roman on trees. Ars Combin (in press)Google Scholar
  2. Abdollahzadeh Ahangar H, Amjadi J, Chellali M, Nazari-Moghaddam S, Sheikholeslami SM (2018) Trees with double Roman domination number twice the domination number plus two. Iran J Sci Technol Trans A Sci.  https://doi.org/10.1007/s40995-018-0535-7
  3. Abdollahzadeh Ahangar H, Chellali M, Sheikholeslami SM (2017b) On the double Roman domination in graphs. Discrete Appl Math 232:1–7MathSciNetCrossRefzbMATHGoogle Scholar
  4. Beeler RA, Haynes TW, Hedetniemi ST (2016) Double Roman domination. Discrete Appl Math 211:23–29MathSciNetCrossRefzbMATHGoogle Scholar
  5. Cockayne EJ, Dreyer PA Jr, Hedetniemic SM, Hedetniemic ST (2004) Roman domination in graphs. Discrete Math 278:11–22MathSciNetCrossRefGoogle Scholar
  6. Haynes TW, Hedetniemi ST, Slater PJ (1998a) Fundamentals of domination in graphs. Marcel Dekker Inc., New YorkzbMATHGoogle Scholar
  7. Haynes TW, Hedetniemi ST, Slater PJ (1998b) Domination in graphs: advanced topics. Marcel Dekker Inc., New YorkzbMATHGoogle Scholar
  8. Henning MA, Hedetniemi ST (2003) Defending the Roman Empire-a new strategy. Discrete Math 266:239–251MathSciNetCrossRefzbMATHGoogle Scholar
  9. Jafari Rad N, Rahbani H (2018) Some progress on the double Roman domination in graphs. Discuss Math Graph Theory (to appear)Google Scholar
  10. McCuaig W, Shepherd B (1989) Domination in graphs with minimum degree two. J Graph Theory 13(6):749–762MathSciNetCrossRefzbMATHGoogle Scholar
  11. ReVelle CS (1997) Can you protect the Roman Empire? Johns Hopkins Mag 49:40–43Google Scholar
  12. Revelle CS, Rosing KE (2000) Defendens imperium romanum: a classical problem in military strategy. Am Math Monthly 107(7):585–594MathSciNetCrossRefzbMATHGoogle Scholar
  13. Stewart I (1999) Defend the Roman Empire. Sci Am 281:136–139CrossRefGoogle Scholar
  14. Volkmann L (2018a) The double Roman domatic number of a graph. J Comb Math Comb Comput 104:205–215MathSciNetzbMATHGoogle Scholar
  15. Volkmann L (2018b) Double Roman domination and domatic numbers of graphs. Commun Comb Optim 3:71–77MathSciNetzbMATHGoogle Scholar
  16. Zhang X, Li Z, Jiang H, Shao Z (2018) Double Roman domination in trees. Inf Process Lett 134:31–34MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of MathematicsAzarbaijan Shahid Madani UniversityTabrizIslamic Republic of Iran
  2. 2.Lehrstuhl II für MathematikRWTH Aachen UniversityAachenGermany

Personalised recommendations