Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
428268 | Information Processing Letters | 2007 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics