Absorbant of generalized de Bruijn digraphs

Authors:
Erfang Shan;T. C. E. Cheng;Liying Kang
Affiliations:
Department of Mathematics, Shanghai University, Shanghai 200444, PR China and Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Mathematics, Shanghai University, Shanghai 200444, PR China
Venue:
Information Processing Letters
Year:
2008

Citing 14
Cited 3

On finding a minimum dominating set in a tournament (Note)

Theoretical Computer Science
Generalized de Bruijn digraphs

Networks
On the existence of (k,l)-kernels in digraphs

Discrete Mathematics
The Hamiltonian property of generalized de Bruijn digraphs

Journal of Combinatorial Theory Series B
Kernels in perfect line-graphs

Journal of Combinatorial Theory Series B
Fractional kernals in digraphs

Journal of Combinatorial Theory Series B
Semikernels and (k,l)-Kernels in Digraphs

SIAM Journal on Discrete Mathematics
Semikernels modulo F and kernels in digraphs

Discrete Mathematics
On the bounded domination number of tournaments

Discrete Mathematics
Kernels in digraphs with covering number at most 3

Discrete Mathematics
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs

Information Processing Letters
Design to Minimize Diameter on Building-Block Network

IEEE Transactions on Computers
The domination and competition graphs of a tournament

Journal of Graph Theory
On the number of quasi-kernels in digraphs

Journal of Graph Theory

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

Quantified Score

Hi-index	0.89

Visualization

Abstract

The generalized de Bruijn digraph G"B(n,d) has good properties as an interconnection network topology. The resource location problem in an interconnection network is one of the facility location problems. Finding absorbants of a digraph corresponds to solving a kind of resource location problem. In this paper, we establish bounds on the absorbant number for G"B(n,d), and we give some sufficient conditions for the absorbant number of G"B(n,d) to achieve the bounds. When d divides n, the extremal digraphs achieving the upper bound are characterized by determining their absorbants.