On the Independent Double Roman Domination in Graphs


An independent double Roman dominating function (IDRDF) on a graph \(G=(V,E)\) is a function \(f{:}V(G)\rightarrow \{0,1,2,3\}\) having the property that if \(f(v)=0\), then the vertex v has at least two neighbors assigned 2 under f or one neighbor w assigned 3 under f, and if \(f(v)=1\), then there exists \(w\in N(v)\) with \(f(w)\ge 2\), such that the set of vertices with positive weight is independent. The weight of an IDRDF is the value \(\sum _{u\in V}f(u)\). The independent double Roman domination number \(i_\mathrm{dR}(G)\) of a graph G is the minimum weight of an IDRDF on G. We continue the study of the independent double Roman domination and show its relationships to both independent domination number (IDN) and independent Roman \(\{2\}\)-domination number (IR2DN). We present several sharp bounds on the IDRDN of a graph G in terms of the order of G, maximum degree and the minimum size of edge cover. Finally, we show that, any ordered pair (ab) is realizable as the IDN and IDRDN of some non-trivial tree if and only if \(2a + 1 \le b \le 3a\).

This is a preview of subscription content, log in to check access.

Fig. 1
Fig. 2


  1. 1.

    Ahangar, H.A., Chellali, M., Sheikholeslami, S.M.: On the double Roman domination in graphs. Discret. Appl. Math. 232, 1–7 (2017)

    MathSciNet  Article  Google Scholar 

  2. 2.

    Beeler, R.A., Haynes, T.W., Hedetniemi, S.T.: Double Roman domination. Discret. Appl. Math. 211, 23–29 (2016)

    MathSciNet  Article  Google Scholar 

  3. 3.

    Chellali, M., Haynes, T.W., Hedetniemi, S.T., MacRae, A.: Roman \(\{2\}\)-domination. Discret. Appl. Math. 204, 22–28 (2016)

    MathSciNet  Article  Google Scholar 

  4. 4.

    Cockayne, E.J., Dreyer, P.A., Hedetniemi, S.M., Hedetniemi, S.T.: Roman domination in graphs. Discret. Math. 278, 11–22 (2004)

    MathSciNet  Article  Google Scholar 

  5. 5.

    Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. Marcel Dekker, New York (1998)

    Google Scholar 

  6. 6.

    Henning, M.A., Klostermeyer, W.F.: Italian domination in trees. Discret. Math. 217, 557–564 (2017)

    MathSciNet  Article  Google Scholar 

  7. 7.

    Maimani, H.R., Momeni, M., Nazari-Moghaddam, S., Rahimi Mahid, F., Sheikholeslami, S.M.: Independent double Roman domination in graphs. Bull. Iran. Math. Soc. (2019). https://doi.org/10.1007/s41980-019-00274-8

    Article  MATH  Google Scholar 

  8. 8.

    Mojdeh, D.A., Parsian, A., Masoumi, I.: Characterization of double Roman trees, to appear in Ars Combinatoria

  9. 9.

    Rahmouni, A., Chellali, M.: Independent Roman \(\{2\}\)-domination in graphs. Discret. Math. 236, 408–414 (2018)

    MathSciNet  Article  Google Scholar 

  10. 10.

    West, D.B.: Introduction to graph theory, 2nd edn. Prentice Hall, New Jersey (2001)

    Google Scholar 

  11. 11.

    Zhang, X., Li, Z., Jiang, H., Shao, Z.: Double Roman domination in trees. Inf. Process. Lett. 134, 31–34 (2018)

    MathSciNet  Article  Google Scholar 

Download references


The authors sincerely thank the referees for their careful review of this paper and some useful comments and valuable suggestions.

Author information



Corresponding author

Correspondence to Doost Ali Mojdeh.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Communicated by Hamid Reza Ebrahimi Vishki.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Mojdeh, D.A., Mansouri, Z. On the Independent Double Roman Domination in Graphs. Bull. Iran. Math. Soc. 46, 905–915 (2020). https://doi.org/10.1007/s41980-019-00300-9

Download citation


  • Independent double Roman domination
  • Independent Roman {2}-domination
  • Independent domination
  • Graphs

Mathematics Subject Classification

  • 05C69
  • 05C5