Efficient twin domination in generalized de Bruijn digraphs
From MaRDI portal
Publication:482195
DOI10.1016/j.disc.2014.10.014zbMath1305.05183OpenAlexW2072345361MaRDI QIDQ482195
Publication date: 19 December 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.10.014
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (5)
Distance domination of generalized de Bruijn and Kautz digraphs ⋮ On the sum of the total domination numbers of a digraph and its converse ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ Constructing the minimum dominating sets of generalized de Bruijn digraphs
Cites Work
- Unnamed Item
- The twin domination number in generalized de Bruijn digraphs
- The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
- Perfect codes over graphs
- On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
- Absorbant of generalized de Bruijn digraphs
- Perfect codes in graphs
- Connectivity of Regular Directed Graphs with Small Diameters
- A Design for Directed Graphs with Minimum Diameter
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- Generalized de Bruijn digraphs
- Design to Minimize Diameter on Building-Block Network
- On Perfect Absorbants in De Bruijn Digraphs
This page was built for publication: Efficient twin domination in generalized de Bruijn digraphs