Abstract
Rautenbach and Volkmann (Appl Math Lett 20:98–102, 2007), gave an upper bound for the k-tuple domination number of a graph. Rad (J Combin Math Comb Comput, 2019, in press) presented an improvement of the above bound using the Caro-Wei Theorem. In this paper, using the well-known Brooks’ Theorem for vertex coloring and vertex covers, we improve the above bounds on the k-tuple domination number under some certain conditions. In the special case \(k=1\), we improve the upper bounds for the domination number (Arnautov in Prikl Mat Program 11:3–8, 1974; Payan in Cahiers Centre Études Recherche Opér 17:307–317, 1975) and the Roman domination number (Cockayne et al. in Discrete Math 278:11–22, 2004). We also improve bounds given by Hansberg and Volkmann (Discrete Appl Math 157:1634–1639, 2009) for Roman k-domination number, and Rad and Rahbani (Discuss Math Graph Theory 39:41–53, 2019) for double Roman domination number.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arnautov, V.I.: Estimations of the external stability number of a graph by means of the minimal degree of vertice. Prikl. Mat. Program. 11, 3–8 (1974)
Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Cambridge Philos. Soc. 37, 194–197 (1941)
Beeler, R., Haynes, T., Hedetniemi, S.T.: Double Roman domination. Discrete Appl. Math. 211, 23–29 (2016)
Cockayne, E.J., Dreyer, P.A., Hedetniemi, S.M., Hedetniemi, S.T.: Roman domination in graphs. Discrete Math. 278, 11–22 (2004)
Hansberg, A., Volkmann, L.: Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number. Discrete Appl. Math. 157, 1634–1639 (2009)
Henning, M.A., Yeo, A.: Total domination in graphs (Springer Monographs in Mathematics. Springer, New York, 2013), pp. xiv+178. ISBN: 978-1-4614-6524-9; 978-1-4614-6525-6
Kazemi, A.P.: Roman \(k\)-tuple domination number of a graph. Iran. J. Math. Sci. Inform. (2014)
Kämmerling, K., Volkmann, L.: Roman \(k\)-domination in graphs. J. Korean Math. Soc. 46, 1309–1318 (2009)
Payan, C.: Sur le nombre d’absorption d’un graphe simple. Cahiers Centre Études Recherche Opér. 17, 307–317 (1975)
Rad, N.J.: On the \(k\)-domination, \(k\)-tuple domination and Roman \(k\)-domination numbers in graphs. J. Combin. Math. Comb. Comput. (to appear)
Rad, N.J., Rahbani, H.: Some progress on the double Roman domination in graphs. Discuss. Math. Graph Theory 39, 41–53 (2019)
Rautenbach, D., Volkmann, L.: New bounds on the \(k\)-domination number and the \(k\)-tuple domination number. Appl. Math. Lett. 20, 98–102 (2007)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Research supported in part by the University of Johannesburg.
Rights and permissions
About this article
Cite this article
Henning, M.A., Rad, N.J. Upper Bounds on the k-Tuple (Roman) Domination Number of a Graph. Graphs and Combinatorics 37, 325–336 (2021). https://doi.org/10.1007/s00373-020-02249-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-020-02249-7