Skip to main content
Log in

Improved Bounds on the k-tuple (Roman) Domination Number of a Graph

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In Henning and Jafari Rad (Graphs Combin, 37: 325–336, 2021), several new probabilistic upper bounds are given on the k-tuple domination number, k-domination number, Roman domination number, and Roman k-domination number of a graph using the well-known Brooks’ Theorem for vertex coloring, improving all of previous given bounds for the above domination variants. In this paper, we use the well-known Turán’s Theorem, and give a slight improvement of all above given bounds.

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.

Similar content being viewed by others

References

  1. Arnautov, V.I.: Estimations of the external stability number of a graph by means of the minimal degree of vertices. Prikl. Mat. Progr. 11, 3–8 (1974)

    Google Scholar 

  2. Chellali, M., Jafari Rad, N., Sheikholeslami, S.M., Volkmann, L.: Roman domination in graphs. In: Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.) Topics in Domination in Graphs. Developments in Mathematics, vol. 64. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-51117-3-11

    Chapter  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Haynes, T.W., HedetniemiS, T., Henning, M.A. (eds.): Topics in Domination in Graphs. Developments in Mathematics, vol. 64. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-51117-3

    Book  Google Scholar 

  5. Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.): Structures of Domination in Graphs. Developments in Mathematics, vol. 66. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-58892-2

    Book  Google Scholar 

  6. Hansberg, A., Volkmann, L.: Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number. Discrete Appl. Math. 157, 1634–1639 (2009)

    Article  MathSciNet  Google Scholar 

  7. Henning M.A., Yeo, A.: Total domination in graphs. In: Springer Monographs in Mathematics. Springer, New York, (2013) xiv+178 pp. ISBN: 978-1-4614-6524-9; 978-1-4614-6525-6

  8. Henning, M.A., Jafari Rad, N.: Upper bounds on the k-tuple (Roman) domination number of a graph. Graphs Combin. 37, 325–336 (2021)

    Article  MathSciNet  Google Scholar 

  9. Kazemi, A.P.: Roman \(k\)-tuple domination number of a graph. Iran. J. Math. Sci. Inf. 15, 101–115 (2020)

    MATH  Google Scholar 

  10. Kämmerling, K., Volkmann, L.: Roman \(k\)-domination in graphs. J. Korean Math. Soc. 46, 1309–1318 (2009)

    Article  MathSciNet  Google Scholar 

  11. Payan, C.: Sur le nombre d’absorption d’un graphe simple. Cah. Centre Études Rech. Opér. 17, 307–317 (1975)

    MathSciNet  MATH  Google Scholar 

  12. Rautenbach, D., Volkmann, L.: New bounds on the \(k\)-domination number and the \(k\)-tuple domination number. Appl. Math. Lett. 20, 98–102 (2007)

    Article  MathSciNet  Google Scholar 

  13. P. Turáan, P.: On an extremal problem in graph theory. Mat. és Fiz. Lap. (in Hungarian) 48, 436–452 (1941)

    Google Scholar 

Download references

Funding

The authors have not disclosed any funding.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Noor A’lawiah Abd Aziz.

Ethics declarations

Conflict of interest

The authors declare that they have no competing interests.

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

Abd Aziz, N.A., Henning, M.A., Rad, N.J. et al. Improved Bounds on the k-tuple (Roman) Domination Number of a Graph. Graphs and Combinatorics 38, 75 (2022). https://doi.org/10.1007/s00373-022-02471-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00373-022-02471-5

Keywords

Mathematics Subject Classification

Navigation