Subgroups as efficient dominating sets in Cayley graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- 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
Cited in
(33)- Efficient \(k\)-distance dominating set in Cayley graphs
- Characterization of subgroup perfect codes in Cayley graphs
- Efficient dominating sets in circulant graphs with domination number prime
- Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3
- The cubic power graph of finite abelian groups
- Location domination of circulant graphs. II
- 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
- Efficient 2-domination number in circulant graphs
- Domination in Cayley graphs: a survey
- On efficient absorbant conjecture in generalized de Bruijn digraphs
- Efficient open domination in Cayley graphs
- Efficient domination in bi-Cayley graphs
- Subgroup Perfect Codes in Cayley Graphs
- Subgroup sum graphs of finite abelian groups
- Independent perfect domination sets in semi-Cayley graphs
- On subgroup perfect codes in Cayley sum graphs
- Independent perfect dominating sets in semi-Cayley graphs
- Efficient dominating sets in circulant 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
- Perfect codes in Cayley graphs
- Domination ratio of integer distance digraphs
- Domination in generalized circulant graphs
- On subgroup perfect codes in Cayley graphs
- Efficient total dominating sets 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)
