The twin domination number in generalized de Bruijn digraphs

Authors:
Erfang Shan;Yanxia Dong;Yukun Cheng
Affiliations:
Department of Mathematics, Shanghai University, Shanghai 200444, PR China;Department of Mathematics, Shanghai University, Shanghai 200444, PR China and College of Mathematics and Information Engineering, Jiaxing University, Zhejiang 314001, PR China;Department of Mathematics, Shanghai University, Shanghai 200444, PR China and School of Mathematics and Statistics, Zhejiang University of Finance and Economics, Hangzhou 310018, PR China
Venue:
Information Processing Letters
Year:
2009

Citing 9
Cited 4

Generalized de Bruijn digraphs

Networks
The Hamiltonian property of generalized de Bruijn digraphs

Journal of Combinatorial Theory Series B
On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs

Discrete Mathematics
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
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

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
Note: On the (h,k)-domination numbers of iterated line digraphs

Discrete Applied Mathematics
Efficient total domination in digraphs

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

Let G=(V,A) be a digraph. A set T of vertices of G is a twin dominating set of G if for every vertex v@?V@?T, there exist u,w@?T (possibly u=w) such that arcs (u,v),(v,w)@?A. The twin domination number@c^*(G) of G is the cardinality of a minimum twin dominating set of G. In this paper we investigate the twin domination number in generalized de Bruijn digraphs G"B(n,d). For the digraphs G"B(n,d), we first establish sharp bounds on the twin domination number. Secondly, we give the exact values of the twin domination number for several types of G"B(n,d) by constructing minimum twin dominating sets in the digraphs. Finally, we present sharp upper bounds for some special generalized de Bruijn digraphs.