Generalized de Bruijn digraphs
Networks
The Hamiltonian property of generalized de Bruijn digraphs
Journal of Combinatorial Theory Series B
Counting closed walks in generalized de Bruijn graphs
Information Processing Letters
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
Information Processing Letters
Information Processing Letters
The bottleneck independent domination on the classes of bipartite graphs and block graphs
Information Sciences—Informatics and Computer Science: An International Journal
Hardness results and approximation algorithms of k-tuple domination in graphs
Information Processing Letters
Graph Theory With Applications
Graph Theory With Applications
On reliability of the folded hypercubes
Information Sciences: an International Journal
Efficient algorithms for the minimum connected domination on trapezoid graphs
Information Sciences: an International Journal
On the k-tuple domination of de Bruijn and Kautz digraphs
Information Processing Letters
Absorbant of generalized de Bruijn digraphs
Information Processing Letters
Connectivity of Regular Directed Graphs with Small Diameters
IEEE Transactions on Computers
Design to Minimize Diameter on Building-Block Network
IEEE Transactions on Computers
A Design for Directed Graphs with Minimum Diameter
IEEE Transactions on Computers
The upper bound on k-tuple domination numbers of graphs
European Journal of Combinatorics
The bipancycle-connectivity of the hypercube
Information Sciences: an International Journal
Edge-fault-tolerant bipanconnectivity of hypercubes
Information Sciences: an International Journal
The twin domination number in generalized de Bruijn digraphs
Information Processing Letters
Information Sciences: an International Journal
The k-tuple twin domination in generalized de Bruijn and Kautz networks
Computers & Mathematics with Applications
Finding minimum weight connected dominating set in stochastic graph based on learning automata
Information Sciences: an International Journal
Efficient total domination in digraphs
Journal of Discrete Algorithms
Intuitionistic fuzzy hypergraphs with applications
Information Sciences: an International Journal
On rainbow domination numbers of graphs
Information Sciences: an International Journal
Dominating problems in swapped networks
Information Sciences: an International Journal
| Hi-index | 0.07 |
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.