Subgroups as efficient dominating sets in Cayley graphs

DOI10.1016/J.DAM.2012.09.005MaRDI QIDQ385141zbMATH OpenOpenAlexFDO

Authors T. Tamizh Chelvam, Sivagnanam Mutharasu

Publication date 29 November 2013

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

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

zbMATH Keywords

circulant graphsdominating setsdomination numberefficient 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)

Recommendations

• Efficient dominating sets in circulant graphs with domination number prime
• Efficient dominating sets in circulant graphs
• Efficient 2-domination number in circulant graphs
• Efficient dominating sets in circulant graphs
• Efficient domination in Cayley graphs of generalized dihedral groups

Cites work

• Dominating sets in Cayley graphs on \(Z_n\)
• Efficient dominating sets in Cayley graphs.
• Efficient domination in circulant graphs with two chord lengths
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Independent domination number of Cayley graphs on \(\mathbb{Z}_n\)
• Independent perfect domination sets in Cayley graphs
• The bondage numbers and efficient dominations of vertex-transitive graphs

Cited in

(39)

• Efficient dominating sets in Cayley graphs.
• Constructing dominating sets in circulant graphs
• Efficient absorbants in generalized de Bruijn digraphs
• Independent perfect domination sets in semi-Cayley graphs
• Domination ratio of a family of integer distance digraphs with arbitrary degree
• Efficient domination in Cayley graphs of generalized dihedral groups
• Subgroup sum graphs of finite abelian groups
• Efficient \(k\)-distance dominating set in Cayley graphs
• On subgroup perfect codes in Cayley graphs
• Characterization of subgroup perfect codes in Cayley graphs
• Domination in Cayley graphs: a survey
• Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3
• Domination ratio of integer distance digraphs
• Independent perfect dominating sets in semi-Cayley graphs
• Perfect codes in vertex-transitive graphs
• Efficient total dominating sets in Cayley graphs
• Domination in generalized circulant graphs
• Efficient domination in bi-Cayley graphs
• Location domination of circulant graphs. II
• Dominating sets in Cayley graphs on \(Z_n\)
• Efficient dominating sets in circulant graphs with domination number prime
• Efficient open domination in Cayley graphs
• Perfect codes in Cayley graphs
• Efficient dominating sets in circulant graphs
• On efficient absorbant conjecture in generalized de Bruijn digraphs
• Subgroup Perfect Codes in Cayley Graphs
• The cubic power graph of finite abelian groups
• Efficient dominating sets in circulant graphs
• Efficient 2-domination number in circulant graphs
• Characterizing subgroup perfect codes by 2-subgroups
• On subgroup perfect codes in Cayley sum graphs
• On regular sets in Cayley graphs
• Generalized non-coprime graphs of groups
• On regular sets in Cayley sum graphs
• Subgroup perfect codes in Lie type simple groups of rank one
• On rings whose prime ideal sum graphs are line graphs
• Subgroups as dominating sets for a Cayley graph of the dicyclic group
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)

This page was built for publication: Subgroups as efficient dominating sets in Cayley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385141)