On efficient absorbant conjecture in generalized de Bruijn digraphs

DOI10.1080/00207160.2016.1154949MaRDI QIDQ4976295zbMATH OpenOpenAlexWikidataFDO

Authors Kuo-Hua Wu, Yue-Li Wang, Ton Kloks

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

zbMATH Keywords

absorbantdominating setefficient absorbantefficient dominating setgeneralized de Bruijn digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Efficient absorbants in generalized de Bruijn digraphs
• The absorbant number of generalized de Bruijn digraphs.
• On perfect absorbants in de Bruijn digraphs
• Absorbant of generalized de Bruijn digraphs
• Private absorbant of generalized de Bruijn digraphs

Cites work

• A Design for Directed Graphs with Minimum Diameter
• A note on efficient domination in a superclass of \(P_5\)-free graphs
• Absorbant of generalized de Bruijn digraphs
• An almost complete description of perfect codes in direct products of cycles
• Connectivity of Regular Directed Graphs with Small Diameters
• Design to Minimize Diameter on Building-Block Network
• Edge Sums Of De Bruijn Interconnection Networks
• Efficient dominating sets in Cayley graphs.
• Efficient dominating sets in circulant graphs with domination number prime
• Efficient domination in circulant graphs
• Efficient domination in cubic vertex-transitive graphs
• Efficient twin domination in generalized de Bruijn digraphs
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• Generalized de Bruijn digraphs
• Independent perfect domination sets in Cayley graphs
• On m-restricted edge connectivity of undirected generalized De Bruijn graphs
• On perfect codes in Cartesian products of graphs
• Perfect codes over graphs
• Subgroups as efficient dominating sets in Cayley graphs
• The bondage numbers and efficient dominations of vertex-transitive graphs
• Worst-case efficient dominating sets in digraphs

Cited in

(6)

• Efficient absorbants in generalized de Bruijn digraphs
• Absorbant of generalized de Bruijn digraphs
• Efficient closed domination in digraph products
• The absorbant number of generalized de Bruijn digraphs.
• Private absorbant of generalized de Bruijn digraphs
• On perfect absorbants in de Bruijn digraphs

This page was built for publication: On efficient absorbant conjecture in generalized de Bruijn digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976295)