Advertisement

On perfect Roman domination number in trees: complexity and bounds

  • Mahsa Darkooti
  • Abdollah AlhevazEmail author
  • Sadegh Rahimi
  • Hadi Rahbani
Article
  • 8 Downloads

Abstract

A perfect Roman dominating function on a graph \(G =(V,E)\) is a function \(f: V \longrightarrow \{0, 1, 2\}\) satisfying the condition that every vertex u with \(f(u) = 0\) is adjacent to exactly one vertex v for which \(f(v)=2\). The weight of a perfect Roman dominating function f is the sum of the weights of the vertices. The perfect Roman domination number of G, denoted by \(\gamma _{R}^{p}(G)\), is the minimum weight of a perfect Roman dominating function in G. In this paper, we first show that the decision problem associated with \(\gamma _{R}^{p}(G)\) is NP-complete for bipartite graphs. Then, we prove that for every tree T of order \(n\ge 3\), with \(\ell \) leaves and s support vertices, \(\gamma _R^P(T)\le (4n-l+2s-2)/5\), improving a previous bound given in Henning et al. (Discrete Appl Math 236:235–245, 2018).

Keywords

Dominating set Roman dominating function Perfect Roman dominating function 

Mathematics Subject Classification

05C69 

Notes

Acknowledgements

The authors would like to thank both referees for their careful review of the paper and for valuable comments. Also, the authors would like to express their deep gratitude to Dr. Nader Jafari-Rad for a number of helpful suggestions. This research was in part supported by a grant from Shahrood University of Technology, Iran.

References

  1. Adabi M, Targhi EE, Rad NJ, Moradi MS (2012) Properties of independent Roman domination in graphs. Australas J Combin 52:11–18MathSciNetzbMATHGoogle Scholar
  2. Ahangar HA, Henning MA, Löwenstein C, Zhao Y, Samodivkin V (2014) Signed Roman domination in graphs. J Comb Optim 27:241–255MathSciNetCrossRefzbMATHGoogle Scholar
  3. Ahangar HA, Henning MA, Samodivkin V, Yero IG (2016) Total Roman domination in graphs. Appl Anal Discrete Math 10(2):501–517MathSciNetCrossRefzbMATHGoogle Scholar
  4. Chambers EW, Kinnersley B, Prince N, West DB (2009) Extremal problems for Roman domination. SIAM J Discrete Math 23:1575–1586MathSciNetCrossRefzbMATHGoogle Scholar
  5. Chellali M, Haynes TW, Hedetniemi ST, McRae AA (2016) Roman 2-domination. Discrete Appl Math 204:22–28MathSciNetCrossRefzbMATHGoogle Scholar
  6. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San FranciscozbMATHGoogle Scholar
  7. Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, Inc., New YorkzbMATHGoogle Scholar
  8. Henning MA, Klostermeyer WF, MacGillivray G (2018) Perfect Roman domination in trees. Discrete Appl Math 236:235–245MathSciNetCrossRefzbMATHGoogle Scholar
  9. Kammerling K, Volkmann L (2009) Roman k-domination in graphs. J Korean Math Soc 46:1309–1318MathSciNetCrossRefzbMATHGoogle Scholar
  10. Klostermeyer W (2015) A taxonomy of perfect domination. J Discrete Math Sci Cryptogr 18:105–116MathSciNetCrossRefGoogle Scholar
  11. Pushpam PRL, Mai TNMN (2009) Edge Roman domination in graphs. J Comb Math Comb Comput 69:175–182MathSciNetzbMATHGoogle Scholar

Copyright information

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

Authors and Affiliations

  • Mahsa Darkooti
    • 1
  • Abdollah Alhevaz
    • 1
    Email author
  • Sadegh Rahimi
    • 1
  • Hadi Rahbani
    • 1
  1. 1.Faculty of Mathematical SciencesShahrood University of TechnologyShahroodIran

Personalised recommendations