Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Factorization of de Bruijn digraphs by cycle-rooted trees
Information Processing Letters
Completely independent spanning trees in the underlying graph of a line digraph
Discrete Mathematics
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
Information Processing Letters
Information Processing Letters
Note: super link-connectivity of iterated line digraphs
Theoretical Computer Science
Hardness results and approximation algorithms of k-tuple domination in graphs
Information Processing Letters
The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
Computers & Mathematics with Applications
Design to Minimize Diameter on Building-Block Network
IEEE Transactions on Computers
Line Digraph Iterations and the (d, k) Digraph Problem
IEEE Transactions on Computers
A Design for Directed Graphs with Minimum Diameter
IEEE Transactions on Computers
The twin domination number in generalized de Bruijn digraphs
Information Processing Letters
On the k-tuple domination of generalized de Brujin and Kautz digraphs
Information Sciences: an International Journal
The k-tuple twin domination in generalized de Bruijn and Kautz networks
Computers & Mathematics with Applications
| Hi-index | 0.89 |
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.