Efficient dominating sets in circulant graphs with domination number prime
From MaRDI portal
Publication:402369
DOI10.1016/J.IPL.2014.06.008zbMATH Open1358.05212OpenAlexW2018743273MaRDI QIDQ402369FDOQ402369
Authors: Yun-Ping Deng 
Publication date: 28 August 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.06.008
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- Perfect codes in graphs
- Title not available (Why is that?)
- Efficient domination in circulant graphs
- Perfect codes over graphs
- Efficient dominating sets in Cayley graphs.
- Independent perfect domination sets in Cayley graphs
- Efficient domination in cubic vertex-transitive graphs
- Efficient domination in circulant graphs with two chord lengths
- The bondage numbers and efficient dominations of vertex-transitive graphs
- Subgroups as efficient dominating sets in Cayley graphs
Cited In (26)
- Efficient \(k\)-distance dominating set in Cayley graphs
- Characterization of subgroup perfect codes in Cayley graphs
- Efficient domination in Cayley graphs of generalized dihedral groups
- Efficient 2-domination number in circulant graphs
- Efficient dominating sets and perfect dominating sets of circulant graphs and unicyclic graphs
- On efficient absorbant conjecture in generalized de Bruijn digraphs
- Perfect codes in 2-valent Cayley digraphs on abelian groups
- Efficient open domination in Cayley graphs
- Regular sets in circulant graphs with degree 3
- Efficient domination in bi-Cayley graphs
- The (non-)existence of perfect codes in Fibonacci cubes
- Subgroup Perfect Codes in Cayley Graphs
- Independent perfect domination sets in semi-Cayley graphs
- Independent perfect dominating sets in semi-Cayley graphs
- Perfect codes in circulant graphs
- Efficient domination in circulant graphs with two chord lengths
- Efficient dominating sets in circulant graphs
- On regular sets in Cayley graphs
- Efficient domination in circulant graphs
- Perfect codes in commuting graphs of symmetric groups
- Perfect codes in Cayley graphs
- Perfect codes in Cayley sum graphs
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- Subgroups as efficient dominating sets in Cayley graphs
- Efficient total dominating sets in Cayley graphs
- Efficient dominating sets in circulant graphs
This page was built for publication: Efficient dominating sets in circulant graphs with domination number prime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402369)
