Absorbant of generalized de Bruijn digraphs
From MaRDI portal
Publication:2380030
DOI10.1016/j.ipl.2007.07.007zbMath1184.68361MaRDI QIDQ2380030
Cheng, T. C. Edwin, Erfang Shan, 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
68R10: Graph theory (including graph drawing) in computer science
Related Items
The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks, On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs, The twin domination number in generalized de Bruijn 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
- 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
- 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