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,

• Type: Journal
• Year: 2008
• Where: DM
• Authors: Andrei Gagarin, Vadim E. Zverovich
• Keywords: DM 2008, Domination Number, K-tuple Domination Number, Upper Bounds