Efficient open domination in Cayley graphs

DOI10.1016/J.AML.2011.12.036zbMath1248.05084OpenAlexW2044740504MaRDI QIDQ452987

Sivagnanam Mutharasu, T. Tamizh Chelvam

Publication date: 18 September 2012

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

Full work available at URL: https://doi.org/10.1016/j.aml.2011.12.036

zbMATH Keywords

Cayley graphscovering projectionefficient open dominationHarary graphs

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

Subgroup sum graphs of finite abelian groups ⋮ Efficient closed domination in digraph products ⋮ Constructing dominating sets in circulant graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ The cubic power graph of finite abelian groups ⋮ Perfect domination sets in Cayley graphs ⋮ Domination in Cayley graphs: a survey ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs

Cites Work

• Efficient domination in circulant graphs with two chord lengths
• Efficient dominating sets in Cayley graphs.
• Total and paired-domination numbers of a tree
• The bondage numbers and efficient dominations of vertex-transitive graphs
• Independent perfect domination sets in Cayley graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient open domination in Cayley graphs