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

Authors:
Yosuke Kikuchi;Yukio Shibata
Affiliations:
Department of Computer Science, Gunma University, Kiryu, Gunma 376-8515, Japan;Department of Computer Science, Gunma University, Kiryu, Gunma 376-8515, Japan
Venue:
Information Processing Letters
Year:
2003

Citing 3
Cited 8

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

Theoretical Computer Science
Kernels in directed graphs: a poison game

Discrete Mathematics
Enumerating the kernels of a directed graph with no odd circuits

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
The bondage numbers of extended de Bruijn and Kautz digraphs

Computers & Mathematics with Applications
Reinforcement numbers of digraphs

Discrete Applied Mathematics
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
Efficient total domination in digraphs

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating sets for undirected graphs. Whereas dominating sets for digraphs have more applications than those for undirected graphs. We construct dominating sets of generalized de Bruijn digraphs where obtained dominating sets have some qualifications. For generalized Kautz digraphs, there is a minimum dominating set in those constructed dominating sets.