Subgroups as efficient dominating sets in Cayley graphs
From MaRDI portal
Publication:385141
DOI10.1016/J.DAM.2012.09.005zbMATH Open1277.05130OpenAlexW2071023321MaRDI QIDQ385141FDOQ385141
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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- Title not available (Why is that?)
- Efficient dominating sets in Cayley graphs.
- Independent perfect domination sets in Cayley graphs
- Efficient domination in circulant graphs with two chord lengths
- The bondage numbers and efficient dominations of vertex-transitive graphs
- Dominating sets in Cayley graphs on \(Z_n\)
- Independent domination number of Cayley graphs on \(\mathbb{Z}_n\)
Cited In (26)
- Characterization of subgroup perfect codes in Cayley graphs
- Efficient dominating sets in circulant graphs with domination number prime
- The cubic power graph of finite abelian groups
- Generalized non-coprime graphs of groups
- Constructing dominating sets in circulant graphs
- Dominating sets in Cayley graphs on \(Z_n\)
- Efficient domination in Cayley graphs of generalized dihedral groups
- Efficient absorbants in generalized de Bruijn digraphs
- Domination in Cayley graphs: a survey
- Perfect Codes in Cayley Graphs
- Efficient domination in bi-Cayley graphs
- Subgroup Perfect Codes in Cayley Graphs
- Subgroup sum graphs of finite abelian groups
- On subgroup perfect codes in Cayley sum graphs
- Independent perfect domination sets in semi-Cayley graphs
- Independent perfect dominating sets in semi-Cayley graphs
- On regular sets in Cayley graphs
- Characterizing subgroup perfect codes by 2-subgroups
- Efficient dominating sets in Cayley graphs.
- Perfect codes in vertex-transitive graphs
- Domination ratio of a family of integer distance digraphs with arbitrary degree
- Domination ratio of integer distance digraphs
- On efficient absorbant conjecture in generalized De Bruijn digraphs
- Domination in generalized circulant graphs
- On subgroup perfect codes in Cayley graphs
- Efficient dominating sets in circulant graphs
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)
