On efficient absorbant conjecture in generalized De Bruijn digraphs
From MaRDI portal
Publication:4976295
DOI10.1080/00207160.2016.1154949zbMath1376.05117OpenAlexW2331464735WikidataQ123191917 ScholiaQ123191917MaRDI QIDQ4976295
Ton Kloks, Kuo-Hua Wu, Yue-Li Wang
Publication date: 28 July 2017
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2016.1154949
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items
Efficient closed domination in digraph products, Efficient absorbants in generalized de Bruijn digraphs
Cites Work
- Subgroups as efficient dominating sets in Cayley graphs
- Efficient dominating sets in circulant graphs with domination number prime
- Efficient domination in cubic vertex-transitive graphs
- Efficient twin domination in generalized de Bruijn digraphs
- On perfect codes in Cartesian products of graphs
- An almost complete description of perfect codes in direct products of cycles
- Perfect codes over graphs
- Efficient dominating sets in Cayley graphs.
- Efficient domination in circulant graphs
- Worst-case efficient dominating sets in digraphs
- Absorbant of generalized de Bruijn digraphs
- A note on efficient domination in a superclass of \(P_5\)-free graphs
- The bondage numbers and efficient dominations of vertex-transitive graphs
- Independent perfect domination sets in Cayley graphs
- Onm-restricted edge connectivity of undirected generalized De Bruijn 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
- Edge Sums Of De Bruijn Interconnection Networks
