The twin domination number in generalized de Bruijn digraphs

DOI10.1016/j.ipl.2009.04.010zbMath1197.05112OpenAlexW2012880777MaRDI QIDQ989508

Erfang Shan, Yanxia Dong, Yu-kun Cheng

Publication date: 20 August 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.04.010

zbMATH Keywords

interconnection networkstwin dominationgeneralized de Bruijn digraphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items

On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks ⋮ On the \((h,k)\)-domination numbers of iterated line digraphs ⋮ Efficient total domination in digraphs ⋮ Efficient twin domination in generalized de Bruijn digraphs ⋮ ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS ⋮ Constructing the minimum dominating sets of generalized de Bruijn digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• The Hamiltonian property of generalized de Bruijn digraphs
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
• Counting closed walks in generalized de Bruijn graphs
• On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
• Absorbant of generalized de Bruijn digraphs
• Connectivity of Regular Directed Graphs with Small Diameters
• Generalized de Bruijn digraphs
• Design to Minimize Diameter on Building-Block Network
• Counting small cycles in generalized de Bruijn digraphs