Skip to main content
SpringerLink
Log in

On double Roman domination problem for several graph classes

  • Published:
Aequationes mathematicae Aims and scope Submit manuscript

Abstract

A double Roman domination function (DRDF) on a graph \(G=(V,E)\) is a mapping \(f :V\rightarrow \{0,1,2,3\}\) satisfying the conditions: (i) each vertex with 0 assigned is adjacent to a vertex with 3 assigned or at least two vertices with 2 assigned and (ii) each vertex with 1 assigned is adjacent to at least one vertex with 2 or 3 assigned. The weight of a DRDF f is defined as the sum \(\sum _{v\in V}f(v)\). The minimum weight of a DRDF on a graph G is called the double Roman domination number (DRDN) of G. This study establishes the values on DRDN for several graph classes. The exact values of DRDN are proved for Kneser graphs \(K_{n,k},n\ge k(k+2)\), Johnson graphs \(J_{n,2}\), for a few classes of convex polytopes, and the flower snarks. Moreover, tight lower and upper bounds on SRDN are proved for some convex polytopes. For the generalized Petersen graphs \(P_{n,3}, n \not \equiv 0\,(\mathrm {mod\ 4})\), we make a further improvement on the best known upper bound from the literature.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Abdollahzadeh Ahangar, H., Henning, M.A., Löwenstein, C., Zhao, Y., Samodivkin, V.: Signed Roman domination in graphs. J. Comb. Optim. 27(2), 241–255 (2014)

    Article  MathSciNet  Google Scholar 

  2. Ahangar, H.A., Chellali, M., Sheikholeslami, S.M.: Outer independent double Roman domination. Appl. Math. Comput. 364, 124617 (2020)

    MathSciNet  Google Scholar 

  3. Abdollahzadeh Ahangar, H., Álvarez, M.P., Chellali, M., Sheikholeslami, S.M., Valenzuela-Tripodoro, J.C.: Triple Roman domination in graphs. Appl. Math. Comput. 391, 125444 (2021)

    MathSciNet  Google Scholar 

  4. Ahangar, H.A., Chellali, M., Sheikholeslami, S.M.: Signed double Roman domination in graphs. Discret. Appl. Math. 257, 1–11 (2019)

    Article  MathSciNet  Google Scholar 

  5. Amjadi, J., Nazari-Moghaddam, S., Sheikholeslami, S.M., Volkmann, L.: An upper bound on the double Roman domination number. J. Comb. Optim. 36(1), 81–89 (2018)

    Article  MathSciNet  Google Scholar 

  6. Baĉa, M.: Labelings of 2 classes of convex polytopes. Utilitas Mathematica 34, 24–31 (1988)

    MathSciNet  Google Scholar 

  7. Baĉa, Martin: On magic labellings of convex polytopes, In Annals of discrete mathematics, pp. 13–16. Elsevier, Amsterdam (1992)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. Bose, P., Gledel, V., Pennarun, C., Verdonschot, S.: Power domination on triangular grids with triangular and hexagonal shape. J. Comb. Optim. 40(2), 482–500 (2020)

    Article  MathSciNet  Google Scholar 

  10. Brinkmann, G., Steffen, E.: Snarks and reducibility. Ars Combin. 50(292–296), 198 (1998)

    MathSciNet  Google Scholar 

  11. Bujtás, C.: Domination number of graphs with minimum degree five. Discussiones Mathematicae Graph Theory 41(3), 763–777 (2021)

    Article  MathSciNet  Google Scholar 

  12. Bujtás, C., Jaskó, S.: Bounds on the 2-domination number. Discret. Appl. Math. 242, 4–15 (2018)

    Article  MathSciNet  Google Scholar 

  13. Cai, Q., Fan, N., Shi, Y., Yao, S.: Integer linear programming formulations for double Roman domination problem. Optim. Methods Softw. 37, 1–22 (2019)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  15. Coxeter, H.S.M.: Self-dual configurations and regular graphs. Bull. Am. Math. Soc. 56(5), 413–455 (1950)

    Article  MathSciNet  Google Scholar 

  16. Cranston, D.W., West, D.B.: An introduction to the discharging method via graph coloring. Discrete Math. 340(4), 766–793 (2017)

    Article  MathSciNet  Google Scholar 

  17. Egunjobi, A.T., Haynes, T.W.: Perfect double Roman domination of trees. Discret. Appl. Math. 284, 71–85 (2020)

    Article  MathSciNet  Google Scholar 

  18. Gao, H., Huang, J., Yang, Y.: Double Roman domination in generalized Petersen graphs. Bulletin Iranian Math. Soc. 48, 1–10 (2021)

    MathSciNet  Google Scholar 

  19. Henning, M.A., Volkmann, L.: Signed Roman k-domination in graphs. Graphs and Combinatorics 32(1), 175–190 (2016)

    Article  MathSciNet  Google Scholar 

  20. Henning, M.A., Klostermeyer, W.F., MacGillivray, G.: Perfect Roman domination in trees. Discret. Appl. Math. 236, 235–245 (2018)

    Article  MathSciNet  Google Scholar 

  21. Imran, M., Ahtsham, S., Semanicova-Fenovcikova, A.: On classes of regular graphs with constant metric dimension. Acta Mathematica Scientia 33(1), 187–206 (2013)

    Article  MathSciNet  Google Scholar 

  22. Isaacs, R.: Infinite families of nontrivial trivalent graphs which are not Tait colorable. Am. Math. Mon. 82(3), 221–239 (1975)

    Article  MathSciNet  Google Scholar 

  23. Huiqin Jiang, P.W., Shao, Z., Rao, Y., Liu, J.-B.: The double Roman domination numbers of generalized Petersen graphs p (n, 2). Mathematics 6(10), 206 (2018)

    Article  Google Scholar 

  24. Khoeilar, R., Karami, H., Chellali, M., Sheikholeslami, S.M.: An improved upper bound on the double Roman domination number of graphs with minimum degree at least two. Discret. Appl. Math. 270, 159–167 (2019)

    Article  MathSciNet  Google Scholar 

  25. Kosari, S., Shao, Z., Sheikholeslami, S.M., Chellali, M., Khoeilar, R., Karami, H.: Double Roman domination in graphs with minimum degree at least two and no \({C}_5\)-cycle. Graphs and Combinatorics 38(2), 1–16 (2022)

    Article  Google Scholar 

  26. Rupnik Poklukar, D, and Žerovnik, J : On the double Roman domination in generalized Petersen graphs p (5k, k). Mathematics 10(1), 119 (2022)

  27. Zehui Shao, P.W., Jiang, H., Li, Z., Žerovnik, J., Zhang, X.: Discharging approach for double Roman domination in graphs. IEEE Access 6, 63345–63351 (2018)

    Article  Google Scholar 

  28. Shao, Z., Erveš, R., Jiang, H., Aljoša Peperko, P.W., Žerovnik, J.: Double Roman graphs in p (3k, k). Mathematics 9(4), 336 (2021)

    Article  Google Scholar 

  29. Stewart, I.: Defend the Roman empire! Sci. Am. 281(6), 136–138 (1999)

    Article  Google Scholar 

  30. Swart, E.R.: The philosophical implications of the four-color problem. Am. Math. Mon. 87(9), 697–707 (1980)

    Article  MathSciNet  Google Scholar 

  31. Atieh Teimourzadeh and Doost Ali Mojdeh. On the upper bound of double roman dominating function. arXiv preprint arXiv:1911.02394, 2019

  32. Volkmann, L.: Double Roman domination and domatic numbers of graphs. Commun. Combinatorics Optim. 3(1), 71–77 (2018)

    MathSciNet  Google Scholar 

  33. Watkins, M.E.: A theorem on Tait colorings with an application to the generalized Petersen graphs. J. Combinat. Theory 6(2), 152–164 (1969)

    Article  MathSciNet  Google Scholar 

  34. Wernicke, P.: Über den kartographischen Vierfarbensatz. Math. Ann. 58(3), 413–426 (1904)

    Article  MathSciNet  Google Scholar 

  35. Zec, T., Grbic, M.: Several Roman domination graph invariants on Kneser graphs. Discrete Math. Theor. Comput. Sci. (2023)

Download references

Funding

This research is supported by a bilateral project between Austria and Bosnia and Herzegovina funded by the Ministry of Civil Affairs of Bosnia and Herzegovina under no. 1259074.

Author information

Authors and Affiliations

  1. Faculty of Natural Sciences and Mathematics, University of Banja Luka, Mladena Stojanovića 2, Banja Luka, Bosnia and Herzegovina

    Tatjana Zec, Dragan Matić & Marko Djukanović

Authors
  1. Tatjana Zec
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dragan Matić
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marko Djukanović
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Z.T. wrote the main manuscript and worked on the methodology. M. D. worked on the conceptualization, methodology, supervision, and revision. D. M. worked on the methodology and revision. All authors reviewed the manuscript.

Corresponding author

Correspondence to Marko Djukanović.

Ethics declarations

Conflict of interest

No potential Conflict of interest is reported by the authors.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zec, T., Matić, D. & Djukanović, M. On double Roman domination problem for several graph classes. Aequat. Math. (2024). https://doi.org/10.1007/s00010-024-01071-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00010-024-01071-3

Keywords

Mathematics Subject Classification

Search

Navigation