Skip to main content
Log in

On the total and strong version for Roman dominating functions in graphs

  • Published:
Aequationes mathematicae Aims and scope Submit manuscript

Abstract

The total and strong version of the Roman domination number (for graphs) is introduced in this research, and the study of its mathematical properties is therefore initiated. We establish upper bounds for such a parameter, and relate it with several parameters concerning vertex domination in graphs. In addition, among other results, we show that for any tree T of order \(n(T)\ge 3\), maximum degree \(\Delta (T)\) and s(T) support vertices, the total strong Roman domination number is bounded below by \(\left\lceil \frac{n(T)+s(T)}{\Delta (T)}\right\rceil +1\).

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Abdollahzadeh Ahangar, H., Henning, M.A., Samodivkin, V., Yero, I.G.: Total Roman domination in graphs. Appl. Anal. Discrete Math 10, 501–517 (2016)

    Article  MathSciNet  Google Scholar 

  2. Abdollahzadeh Ahangar, H., Amjadi, J., Chellali, M., Nazari-Moghaddam, S., Sheikholeslami, S.M.: Total Roman reinforcement in graphs. Discuss. Math. Graph Theory 39, 787–803 (2019)

    Article  MathSciNet  Google Scholar 

  3. Abdollahzadeh Ahangar, H., Amjadi, J., Sheikholeslami, S.M., Soroudi, M.: On the total Roman domination number of graphs. ARS Combin. 150, 225–240 (2020)

    Google Scholar 

  4. Abdollahzadeh Ahangar, H., Amjadi, J., Sheikholeslami, S.M., Soroudi, M.: Total Roman domination and 2-independence in trees. ARS Combin. (to appear)

  5. Álvarez-Ruiz, M.P., Mediavilla-Gradolph, T., Sheikholeslami, S.M., Yero, I.G., Valenzuela-Tripodoro, J.C.: On the strong Roman domination number of graphs. Discrete Appl. Math. 231, 44–59 (2017)

    Article  MathSciNet  Google Scholar 

  6. Amjadi, J.: Total Roman domination subdivision number in graphs. Commun. Comb. Optim. 5, 157–168 (2020)

    MathSciNet  Google Scholar 

  7. Amjadi, J., Nazari-Moghaddam, S., Sheikholeslami, S.M.: Global total Roman domination in graphs. Discrete Math. Algorithms Appl. 9, 1750050 (2017)

    Article  MathSciNet  Google Scholar 

  8. Amjadi, J., Nazari-Moghaddam, S., Sheikholeslami, S.M.: Total Roman domatic number of a graph. Asian-Eur. J. Math. 13, 12 (2020)

    Article  MathSciNet  Google Scholar 

  9. Amjadi, J., Nazari-Moghaddam, S., Sheikholeslami, S.M., Volkmann, L.: Total Roman domination number of trees. Aust. J. Combin. 69, 271–285 (2017)

    MathSciNet  MATH  Google Scholar 

  10. Amjadi, J., Sheikholeslami, S.M., Soroudi, M.: Nordhaus–Gaddum bounds for total Roman domination. J. Combin. Optim. 35, 126–133 (2018)

    Article  MathSciNet  Google Scholar 

  11. Amjadi, J., Sheikholeslami, S.M., Soroudi, M.: On the total Roman domination in trees. Discuss. Math. Graph Theory 39, 519–532 (2019)

    Article  MathSciNet  Google Scholar 

  12. Cabrera García, S., Cabrera Martínez, A., Yero, I.G.: Quasi-total Roman domination in graphs. Results Math. 74, 173 (2019)

    Article  MathSciNet  Google Scholar 

  13. Cabrera Martínez, A., Kuziak, D., Peterin, I., Yero, I.G.: Dominating the direct product of two graphs through total Roman strategies. Mathematics (MDPI) 8(9), 1438 (2020)

    Article  Google Scholar 

  14. Campanelli, N., Kuziak, D.: Total Roman domination in the lexicographic product of graphs. Discrete Appl. Math. 263, 88–95 (2019)

    Article  MathSciNet  Google Scholar 

  15. Chambers, E.W., Kinnersley, B., Prince, N., West, D.B.: Extremal problems for Roman domination. SIAM J. Discrete Math. 23, 1575–1586 (2009)

    Article  MathSciNet  Google Scholar 

  16. Chellali, M., Jafari Rad, N., Sheikholeslami, S.M., Volkmann, L.: Topics in Domination in Graphs. In: Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.) Roman Domination in Graphs. Springer International Publishing, Cham (2020)

    Chapter  Google Scholar 

  17. Chellali, M., Jafari Rad, N., Sheikholeslami, S.M., Volkmann, L.: Structures of domination in graphs. In: Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.) Varieties of Roman domination. Springer International Publishing, Cham (2021)

    Google Scholar 

  18. Chellali, M., Jafari Rad, N., Sheikholeslami, S.M., Volkmann, L.: Varieties of Roman domination II. AKCE Int. J. Graphs Combin. 17, 966–984 (2020)

    Article  MathSciNet  Google Scholar 

  19. Chellali, M., Jafari Rad, N., Sheikholeslami, S.M., Volkmann, L.: A survey on Roman domination parameters in directed graphs. J. Combin. Math. Combin. Comput. (to appear)

  20. Chellali, M., Jafari Rad, N., Sheikholeslami, S.M., Volkmann, L.: The Roman domatic problem in graphs and digraphs: a survey. Discuss. Math. Graph Theory (to appear)

  21. Cockayne, E.J., Dawes, R.M., Hedetniemi, S.T.: Total domination in graphs. Networks 10, 211–219 (1980)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  23. Fink, J.F., Jacobson, M.S., Kinch, L.F., Roberts, J.: On graphs having domination number half their order. Period. Math. Hungar. 16, 287–293 (1985)

    Article  MathSciNet  Google Scholar 

  24. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  25. Goddard, W., Henning, M.A.: Independent domination in graphs: a survey and recent results. Discrete Math. 313(7), 839–854 (2013)

    Article  MathSciNet  Google Scholar 

  26. Haynes, T.W., Hedetniemi, S.T., Henning, M.A.: Topics in Domination in Graphs. Springer International Publishing, Cham (2020)

    Book  Google Scholar 

  27. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker Inc, New York (1998)

    MATH  Google Scholar 

  28. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs: Advanced Topics. Chapman & Hall, CRC Press, Boca Raton (1998)

    MATH  Google Scholar 

  29. Henning, M.A.: Recent results on total domination in graphs: A survey. Discrete Math. 309, 32–63 (2009)

    Article  MathSciNet  Google Scholar 

  30. Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer Monographs in Mathematics (2013). ISBN: 978-1-4614-6524-9 (Print) 978-1-4614-6525-6 (Online)

  31. Liu, C.-H., Chang, G.J.: Roman domination on strongly chordal graphs. J. Combin. Optim. 26, 608–619 (2013)

    Article  MathSciNet  Google Scholar 

  32. Ore, O.: Theory of Graphs, American Mathematical Society Colloquium Publications, 38. American Mathematical Society, Providence, RI (1962)

    Google Scholar 

  33. Payan, C., Xuong, N.H.: Domination-balanced graphs. J. Graph Theory 6, 23–32 (1982)

    Article  MathSciNet  Google Scholar 

  34. Stewart, I.: Defend the Roman Empire. Sci. Am. 28(6), 136–139 (1999)

    Article  Google Scholar 

  35. Yero, I.G., Rodríguez-Velázquez, J.A.: Roman domination in Cartesian product graphs and strong product graphs. Appl. Anal. Discrete Math. 7, 262–274 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

We thank the reviewers for all the suggested remarks that have contributed to improve the quality and presentation of this article. The last author (Ismael G. Yero) has been partially supported by “Junta de Andalucía”, FEDER-UPO Research and Development Call, Reference Number UPO-1263769.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to I. G. Yero.

Additional information

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nazari-Moghaddam, S., Soroudi, M., Sheikholeslami, S.M. et al. On the total and strong version for Roman dominating functions in graphs. Aequat. Math. 95, 215–236 (2021). https://doi.org/10.1007/s00010-021-00778-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00010-021-00778-x

Mathematics Subject Classification

Keywords

Navigation