The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
From MaRDI portal
Publication:998382
DOI10.1016/j.disc.2007.12.020zbMath1180.05079OpenAlexW2024923952MaRDI QIDQ998382
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.020
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (11)
On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks ⋮ Partitioning vertices into in- and out-dominating sets in digraphs ⋮ On the \((h,k)\)-domination numbers of iterated line digraphs ⋮ Efficient total domination in digraphs ⋮ Efficient twin domination in generalized de Bruijn digraphs ⋮ Twin domination in generalized Kautz digraphs ⋮ MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS ⋮ ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS ⋮ The twin domination number in generalized de Bruijn digraphs ⋮ Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
Cites Work
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
- \(k\)-tuple domination in graphs
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- Uniform homomorphisms of de Bruijn and Kautz networks
- Algorithmic aspect of \(k\)-tuple domination in graphs.
- On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
- Characterizations of trees with equal paired and double domination numbers
- Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
