Perfect domination sets in Cayley graphs

DOI10.1016/j.dam.2013.09.020zbMath1300.05228OpenAlexW2004869540MaRDI QIDQ741744

Young Soo Kwon, Jaeun Lee

Publication date: 12 September 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.09.020

zbMATH Keywords

Cayley graphgraph bundleperfect 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)

Related Items (9)

On the perfect differential of a graph ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ On the sum of the total domination numbers of a digraph and its converse ⋮ (Total) domination in prisms ⋮ Total domination in digraphs ⋮ A note on lower bounds for the total domination number of digraphs ⋮ Domination in Cayley graphs: a survey ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs ⋮ On perfect and quasiperfect dominations in graphs

Cites Work

• Efficient open domination in Cayley graphs
• The maximum genus of graph bundles
• Generating all graph coverings by permutation voltage assignments
• Constructing covering codes with given automorphisms
• Independent perfect domination sets in Cayley graphs
• Dominating sets in n‐cubes
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect domination sets in Cayley graphs