Efficient dominating sets in circulant graphs with domination number prime

DOI10.1016/j.ipl.2014.06.008zbMath1358.05212OpenAlexW2018743273MaRDI QIDQ402369

Yun-Ping Deng

Publication date: 28 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.06.008

zbMATH Keywords

Cayley graphscombinatorial problemscirculant graphsefficient dominating sets

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 (12)

Efficient domination in Cayley graphs of generalized dihedral groups ⋮ Independent perfect dominating sets in semi-Cayley graphs ⋮ Perfect Codes in Cayley Graphs ⋮ Subgroup Perfect Codes in Cayley Graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Efficient dominating sets in circulant graphs ⋮ Perfect codes in circulant graphs ⋮ The (non-)existence of perfect codes in Fibonacci cubes ⋮ Independent perfect domination sets in semi-Cayley graphs ⋮ Characterization of subgroup perfect codes in Cayley graphs ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ Perfect codes in Cayley sum graphs

Cites Work

• Unnamed Item
• Subgroups as efficient dominating sets in Cayley graphs
• Efficient domination in cubic vertex-transitive graphs
• Efficient domination in circulant graphs with two chord lengths
• Perfect codes over graphs
• Efficient dominating sets in Cayley graphs.
• Efficient domination in circulant graphs
• The bondage numbers and efficient dominations of vertex-transitive graphs
• Perfect codes in graphs
• Independent perfect domination sets in Cayley graphs

This page was built for publication: Efficient dominating sets in circulant graphs with domination number prime