Classification of efficient dominating sets of circulant graphs of degree 5

DOI10.1007/s00373-022-02527-6zbMath1493.05232OpenAlexW4285394041MaRDI QIDQ2157841

Young Soo Kwon, Jaeun Lee, Moo Young Sohn

Publication date: 22 July 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02527-6

zbMATH Keywords

circulant 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)

Cites Work

• Unnamed Item
• Total perfect codes in Cayley graphs
• Perfect codes in circulant graphs
• Efficient domination in circulant graphs with two chord lengths
• Perfect codes over graphs
• Weighted efficient domination problem on some perfect graphs
• Efficient dominating sets in Cayley graphs.
• Cyclotomic graphs and perfect codes
• The weighted perfect domination problem and its variants
• Efficient domination in circulant graphs
• Existence of efficient total dominating sets of circulant graphs of degree 4
• Perfect codes in graphs
• Independent perfect domination sets in Cayley graphs
• Perfect Codes in Cayley Graphs
• Subgroup Perfect Codes in Cayley Graphs

This page was built for publication: Classification of efficient dominating sets of circulant graphs of degree 5