Efficient open domination in Cayley graphs
From MaRDI portal
Publication:452987
DOI10.1016/J.AML.2011.12.036zbMATH Open1248.05084OpenAlexW2044740504MaRDI QIDQ452987FDOQ452987
Authors: T. Tamizh Chelvam, Sivagnanam Mutharasu 
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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- 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\)
- Total and paired-domination numbers of a tree
- Total and connected domination numbers of Cayley graphs on \(\mathbb{Z}_n\)
Cited In (14)
- On subgroup regular sets in Cayley sum graphs
- Subgroup total perfect codes in Cayley sum graphs
- The cubic power graph of finite abelian groups
- Generalized non-coprime graphs of groups
- Constructing dominating sets in circulant graphs
- Domination in Cayley graphs: a survey
- Regular sets in circulant graphs with degree 3
- Title not available (Why is that?)
- Subgroup sum graphs of finite abelian groups
- Efficient dominating sets in Cayley graphs.
- Perfect domination sets in Cayley graphs
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- Efficient closed domination in digraph products
- The total bondage numbers and efficient total dominations of vertex-transitive graphs
This page was built for publication: Efficient open domination in Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452987)
