Recommendations
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
- 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
- Total and connected domination numbers of Cayley graphs on \(\mathbb{Z}_n\)
- Total and paired-domination numbers of a tree
Cited in
(21)- Efficient dominating sets in Cayley graphs.
- Constructing dominating sets in circulant graphs
- Subgroup sum graphs of finite abelian groups
- Efficient \(k\)-distance dominating set in Cayley graphs
- Domination in Cayley graphs: a survey
- The total bondage numbers and efficient total dominations of vertex-transitive graphs
- Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3
- Efficient closed domination in digraph products
- Efficient total dominating sets in Cayley graphs
- Partitioning the vertex set of G to make G H an efficient open domination graph
- Efficient domination in bi-Cayley graphs
- scientific article; zbMATH DE number 5080622 (Why is no real title available?)
- Efficient dominating sets in circulant graphs with domination number prime
- The cubic power graph of finite abelian groups
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- On subgroup regular sets in Cayley sum graphs
- Generalized non-coprime graphs of groups
- Subgroup total perfect codes in Cayley sum graphs
- Regular sets in circulant graphs with degree 3
- New characterization of efficient closed and open dominated graphs
- Perfect domination sets in Cayley 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)
