Perfect domination sets in Cayley graphs
From MaRDI portal
Publication:741744
DOI10.1016/J.DAM.2013.09.020zbMATH Open1300.05228OpenAlexW2004869540MaRDI QIDQ741744FDOQ741744
Authors: Young Soo Kwon, Jaeun Lee 
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.09.020
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?)
- Generating all graph coverings by permutation voltage assignments
- Dominating sets in n‐cubes
- Independent perfect domination sets in Cayley graphs
- The maximum genus of graph bundles
- Efficient open domination in Cayley graphs
- Constructing covering codes with given automorphisms
- Title not available (Why is that?)
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)
