On the k-tuple domination of generalized de Brujin and Kautz digraphs
| Autor: | Zengrong Liu, Erfang Shan, Lingye Wu |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
De Bruijn sequence
Discrete mathematics Information Systems and Management Domination analysis Digraph Computer Science Applications Theoretical Computer Science Vertex (geometry) Combinatorics Artificial Intelligence Control and Systems Engineering Dominating set Tuple Computer Science::Databases Software Mathematics |
| Zdroj: | Information Sciences. 180:4430-4435 |
| ISSN: | 0020-0255 |
| DOI: | 10.1016/j.ins.2010.07.001 |
| Popis: | A vertex u in a digraph G=(V,A) is said to dominate itself and vertices v such that (u,v)@?A. For a positive integer k, a k-tuple dominating set of G is a subset D of vertices such that every vertex in G is dominated by at least k vertices in D. The k-tuple domination number of G is the minimum cardinality of a k-tuple dominating set of G. This paper deals with the k-tuple domination problem on generalized de Bruijn and Kautz digraphs. We establish bounds on the k-tuple domination number for the generalized de Bruijn and Kautz digraphs and we obtain some conditions for the k-tuple domination number attaining the bounds. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect