On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs

Authors:
Yosuke Kikuchi;Yukio Shibata
Affiliations:
-;-
Venue:
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Year:
2001

Citing 5
Cited 0

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
Design to Minimize Diameter on Building-Block Network

IEEE Transactions on Computers
A Design for Directed Graphs with Minimum Diameter

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

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 set for undirected graphs. Whereas dominating sets for digraphs have more applications than undirected graphs. We construct dominating sets of generalized de Bruijn digraphs under some conditions. We investigate consecutive minimum dominating set of the generalized de Bruijn digraphs. For generalized Kautz digraphs, there is a consecutive minimum dominating set that is a minimum dominating set.