Efficient twin domination in generalized de Bruijn digraphs
From MaRDI portal
(Redirected from Publication:482195)
Recommendations
- The twin domination number in generalized de Bruijn digraphs
- Twin domination in generalized de Bruijn and Kautz digraphs
- On the twin domination number in generalized de Bruijn and generalized Kautz digraphs
- Twin domination in generalized Kautz digraphs
- The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
Cites work
- scientific article; zbMATH DE number 2191983 (Why is no real title available?)
- A Design for Directed Graphs with Minimum Diameter
- Absorbant of generalized de Bruijn digraphs
- Connectivity of Regular Directed Graphs with Small Diameters
- Design to Minimize Diameter on Building-Block Network
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- Generalized de Bruijn digraphs
- On perfect absorbants in de Bruijn digraphs
- On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
- Perfect codes in graphs
- Perfect codes over graphs
- The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
- The twin domination number in generalized de Bruijn digraphs
Cited in
(6)- Distance domination of generalized de Bruijn and Kautz digraphs
- On the sum of the total domination numbers of a digraph and its converse
- The twin domination number in generalized de Bruijn digraphs
- Constructing the minimum dominating sets of generalized de Bruijn digraphs
- On efficient absorbant conjecture in generalized de Bruijn digraphs
- Efficient absorbants in generalized de Bruijn digraphs
This page was built for publication: Efficient twin domination in generalized de Bruijn digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482195)