Efficient absorbants in generalized de Bruijn digraphs

DOI10.1016/J.DISOPT.2017.01.005MaRDI QIDQ1751232zbMATH OpenOpenAlexFDO

Authors Alexander Chane Shiau, Tzong-Huei Shiau, Yue-Li Wang

Publication date 24 May 2018

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2017.01.005

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) Structural characterization of families of graphs (05C75)

Recommendations

• On efficient absorbant conjecture in generalized de Bruijn digraphs
• Efficient open domination in digraphs
• The absorbant number of generalized de Bruijn digraphs.
• On perfect absorbants in 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
• Constructing the minimum dominating sets of generalized de Bruijn digraphs
• Design to Minimize Diameter on Building-Block Network
• Efficient dominating sets in Cayley graphs.
• 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
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• Independent \([1,k]\)-sets in graphs
• Independent perfect domination sets in Cayley graphs
• On efficient absorbant conjecture in generalized de Bruijn digraphs
• On perfect absorbants in de Bruijn digraphs
• On perfect codes in Cartesian products of graphs
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• Perfect codes in graphs
• Perfect codes over graphs
• Subgroups as efficient dominating sets in Cayley graphs
• The bondage numbers and efficient dominations of vertex-transitive graphs
• Weighted efficient domination for P₆-free and for P₅-free graphs
• Worst-case efficient dominating sets in digraphs

Cited in

(6)

• Efficient closed domination in digraph products
• The absorbant number of generalized de Bruijn digraphs.
• Semicomplete absorbent sets in digraphs
• Private absorbant of generalized de Bruijn digraphs
• On efficient absorbant conjecture in generalized de Bruijn digraphs
• On perfect absorbants in de Bruijn digraphs

This page was built for publication: Efficient absorbants in generalized de Bruijn digraphs

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