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

DOI10.1016/S0020-0190(02)00479-9zbMath1173.68607MaRDI QIDQ1007577

Yukio Shibata, Yosuke Kikuchi

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

kernel; interconnection networks; dominating set; domination number; generalized de Bruijn digraphs; absorbant; generalized Kautz digraphs

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

Related Items

Power domination in generalized undirected de Bruijn graphs and Kautz graphs, The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks, Efficient total domination in digraphs, Efficient twin domination in generalized de Bruijn digraphs, On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs, The twin domination number in generalized de Bruijn digraphs, The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs, Reinforcement numbers of digraphs, Distance domination of generalized de Bruijn and Kautz digraphs, Efficient absorbants in generalized de Bruijn digraphs, Constructing the minimum dominating sets of generalized de Bruijn digraphs, On the \(k\)-tuple domination of de Bruijn and Kautz digraphs, Absorbant of generalized de Bruijn digraphs, Identifying codes on directed de Bruijn graphs, The bondage numbers of extended de Bruijn and Kautz digraphs, Bounds on the absorbant number of generalized Kautz digraphs, Twin domination in generalized Kautz digraphs, ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On domination and independent domination numbers of a graph
• On finding a minimum dominating set in a tournament
• Complexity of problems in games, graphs and algebraic equations
• Complexity of finding k-path-free dominating sets in graphs
• A combinatorial problem in logic
• Enumerating the kernels of a directed graph with no odd circuits
• Kernels in directed graphs: A poison game
• A Design for Directed Graphs with Minimum Diameter
• Design to Minimize Diameter on Building-Block Network