Domination in Cayley graphs: a survey

DOI10.1016/j.akcej.2017.11.005zbMath1423.05083OpenAlexW2777703171MaRDI QIDQ2329914

T. Tamizh Chelvam, M. Sivagami

Publication date: 18 October 2019

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

Full work available at URL: https://doi.org/10.1016/j.akcej.2017.11.005

zbMATH Keywords

Cayley graphunitary Cayley graphdominating setsefficient dominating setsE-chain

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

Complement of the reduced non-zero component graph of free semimodules ⋮ Structure and substructure connectivity of circulant graphs and hypercubes

Cites Work

• Subgroups as efficient dominating sets in Cayley graphs
• Efficient open domination in Cayley graphs
• Perfect domination sets in Cayley graphs
• Efficient domination in circulant graphs with two chord lengths
• Efficient dominating sets in Cayley graphs.
• Efficient domination in circulant graphs
• Perfect dominating sets in the Cartesian products of prime cycles
• The bondage numbers and efficient dominations of vertex-transitive graphs
• Independent perfect domination sets in Cayley graphs
• PRODUCTS OF CIRCULANT GRAPHS
• Perfect domination in regular grid graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Domination in Cayley graphs: a survey