A generalised upper bound for the k-tuple domination number

In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any graph G,@c"x"k(G)==3; d is the average degree.

[1]  Frank Harary,et al.  Nordhaus-Gaddum inequalities for domination in graphs , 1996, Discret. Math..

[2]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[3]  Dieter Rautenbach,et al.  New bounds on the k-domination number and the k-tuple domination number , 2007, Appl. Math. Lett..

[4]  Michael A. Henning,et al.  On Double Domination in Graphs , 2005, Discuss. Math. Graph Theory.

[5]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[6]  Christian Laforest,et al.  Hardness results and approximation algorithms of k-tuple domination in graphs , 2004, Inf. Process. Lett..

[7]  Chung-Shou Liao,et al.  K-tuple Domination in Graphs , 2003, Inf. Process. Lett..

[8]  Chung-Shou Liao,et al.  ALGORITHMIC ASPECT OF k-TUPLE DOMINATION IN GRAPHS , 2002 .