Absorbant of generalized de Bruijn digraphs

DOI10.1016/j.ipl.2007.07.007zbMath1184.68361OpenAlexW2039710333MaRDI QIDQ2380030

Erfang Shan, Cheng, T. C. Edwin, Li-ying Kang

Publication date: 24 March 2010

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

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

zbMATH Keywords

interconnection networksgeneralized de Bruijn digraphabsorbant

Mathematics Subject Classification ID

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

Related Items (13)

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 ⋮ Bounds on the domination number of a digraph ⋮ Efficient twin domination in generalized de Bruijn digraphs ⋮ Bounds on the absorbant number of generalized Kautz digraphs ⋮ Twin domination in generalized Kautz digraphs ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS ⋮ The twin domination number in generalized de Bruijn digraphs ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ Total domination in digraphs ⋮ Constructing the minimum dominating sets of generalized de Bruijn digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence of (k,\(\ell)\)-kernels in digraphs
• Kernels in perfect line-graphs
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• On finding a minimum dominating set in a tournament
• The Hamiltonian property of generalized de Bruijn digraphs
• Fractional kernels in digraphs
• On the bounded domination number of tournaments
• Kernels in digraphs with covering number at most 3
• Semikernels modulo \(F\) and kernels in digraphs
• Generalized de Bruijn digraphs
• Design to Minimize Diameter on Building-Block Network
• The domination and competition graphs of a tournament
• A sufficient condition for the existence of k-kernels in digraphs
• Semikernels and (k,l)-Kernels in Digraphs
• On the number of quasi-kernels in digraphs

This page was built for publication: Absorbant of generalized de Bruijn digraphs