Efficient domination in Cayley graphs of generalized dihedral groups

DOI10.7151/dmgt.2309zbMath1492.05111OpenAlexW3009979255MaRDI QIDQ2151216

Primož Šparl, Štefko Miklavič, Cafer Caliskan, Sibel Özkan

Publication date: 1 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2309

zbMATH Keywords

Cayley graphgeneralized dihedral groupefficient domination 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) Group actions on combinatorial structures (05E18)

Related Items (2)

On the order of antipodal covers ⋮ Distance-regular graphs admitting a perfect 1-code

Uses Software

• Magma

Cites Work

• Unnamed Item
• Total perfect codes in Cayley graphs
• 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
• The Hamiltonicity of generalized honeycomb torus networks
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs
• Efficient dominating sets in circulant graphs
• Perfect codes in circulant graphs
• Generalized honeycomb torus is Hamiltonian
• Efficient domination in circulant graphs with two chord lengths
• Honeycomb toroidal graphs are Cayley graphs
• Generalized honeycomb torus
• Embedding a fault-free Hamiltonian cycle in a class of faulty generalized honeycomb tori
• The Magma algebra system. I: The user language
• Efficient dominating sets in Cayley graphs.
• Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
• Cubic vertex-transitive graphs on up to 1280 vertices
• Efficient domination in circulant graphs
• Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
• The bondage numbers and efficient dominations of vertex-transitive graphs
• Perfect codes in graphs
• Independent perfect domination sets in Cayley graphs
• A canonical representation of trivalent hamiltonian graphs

This page was built for publication: Efficient domination in Cayley graphs of generalized dihedral groups