Worst-case efficient dominating sets in digraphs

DOI10.1016/J.DAM.2012.11.016MaRDI QIDQ1949100zbMATH OpenOpenAlexFDO

Authors Italo J. Dejter

Publication date 25 April 2013

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1201.1728

zbMATH Keywords

Cayley graphdigraphstar graphefficient dominating set

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: Let $$. {it Worst-case efficient dominating sets in digraphs} are conceived so that their presence in certain strong digraphs $vec{ST}_n$ corresponds to that of efficient dominating sets in star graphs $S{T}_n$: The fact that the star graphs $S{T}_n$ form a so-called dense segmental neighborly E-chain is reflected in a corresponding fact for the digraphs $vec{ST}_n$. Related chains of graphs and open problems are presented as well.

Recommendations

• Efficient open domination in digraphs
• Efficient total domination in digraphs
• scientific article; zbMATH DE number 637310
• scientific article; zbMATH DE number 4085682
• On efficiently total dominatable digraphs

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1153450 (Why is no real title available?)
• A group-theoretic model for symmetric interconnection networks
• Disjoint Hamilton cycles in the star graph
• Efficient dominating sets in Cayley graphs.
• Hamiltonian-laceability of star graphs
• Perfect codes in graphs
• Perfect codes over graphs

Cited in

(6)

• Efficient absorbants in generalized de Bruijn digraphs
• On efficient absorbant conjecture in generalized de Bruijn digraphs
• The fullerene graphs with a perfect star packing
• On efficiently total dominatable digraphs
• Constructing the minimum dominating sets of generalized de Bruijn digraphs
• Efficient dominating sets in circulant graphs

This page was built for publication: Worst-case efficient dominating sets in digraphs

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