On the k-tuple domination of de Bruijn and Kautz digraphs
In a digraph G, a vertex u is said to dominate itself and vertices v such that (u, v) is an arc of G. For a positive integer k, a k-tuple dominating set D of a digraph is a subset of vertices such that every vertex is dominated by at least k vertices in D. The k-tuple domination number of a given digraph is the minimum cardinality of a k-tuple dominating set of the digraph. In this letter, we give the exact values of the k-tuple domination number of de Bruijn and Kautz digraphs. (c) 2007 Elsevier B.V. All rights reserved.
k-tuple domination kautz digraph de bruijn digraph interconnection networks