Worst-case efficient dominating sets in digraphs

DOI10.1016/j.dam.2012.11.016zbMath1263.05069arXiv1201.1728OpenAlexW1973259076MaRDI QIDQ1949100

Italo Jose 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

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

Related Items (6)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Disjoint Hamilton cycles in the star graph
• Perfect codes over graphs
• Efficient dominating sets in Cayley graphs.
• Perfect codes in graphs
• A group-theoretic model for symmetric interconnection networks
• Hamiltonian-laceability of star graphs

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