Perfect domination sets in Cayley graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1457239 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- Constructing covering codes with given automorphisms
- Dominating sets in n‐cubes
- Efficient open domination in Cayley graphs
- Generating all graph coverings by permutation voltage assignments
- Independent perfect domination sets in Cayley graphs
- The maximum genus of graph bundles
Cited in
(14)- On subgroup regular sets in Cayley sum graphs
- Subgroup total perfect codes in Cayley sum graphs
- Independent perfect domination sets in Cayley graphs
- On the sum of the total domination numbers of a digraph and its converse
- Domination in Cayley graphs: a survey
- A note on lower bounds for the total domination number of digraphs
- Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs
- Total domination in digraphs
- On regular sets in Cayley graphs
- On perfect and quasiperfect dominations in graphs
- (Total) domination in prisms
- On the perfect differential of a graph
- C-perfect hypergraphs
- The total bondage numbers and efficient total dominations of vertex-transitive graphs
This page was built for publication: Perfect domination sets in Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741744)