Perfect codes in Cayley graphs of abelian groups
From MaRDI portal
Cites work
- A combinatorial problem in the symmetric group
- A survey of perfect codes
- A survey of perfect codes
- Algebraic number theory
- Cyclotomic graphs and perfect codes
- Efficient dominating sets in Cayley graphs.
- Efficient dominating sets in circulant graphs
- Efficient dominating sets in circulant graphs with domination number prime
- Efficient domination in circulant graphs
- Efficient domination in circulant graphs with two chord lengths
- Efficient domination in cubic vertex-transitive graphs
- Efficient open domination in graph products
- Factoring Finite Abelian Groups by Subsets with Maximal Span
- Factoring groups into subsets.
- Full Rank Tilings of Finite Abelian Groups
- Independent perfect domination sets in Cayley graphs
- Lattice-like total perfect codes
- Odd neighborhood transversals on grid graphs
- On perfect codes and related concepts
- On the factorisation of finite abelian groups. II
- Perfect codes and regular partitions in graphs and groups
- Perfect Codes for Metrics Induced by Circulant Graphs
- Perfect codes in \(\mathrm{SL}(2,2^f)\)
- Perfect codes in Cayley graphs
- Perfect codes in circulant graphs
- Perfect codes in graphs
- Perfect codes over graphs
- Perfect domination in regular grid graphs
- Perfect domination sets in Cayley graphs
- Product Constructions for Perfect Lee Codes
- Rédei-matrices and applications
- Subgroup regular sets in Cayley graphs
- Total perfect codes in Cayley graphs
- Total perfect codes in tensor products of graphs.
- Über einfache und mehrfache Bedeckung des \(n\)-dimensionalen Raumes mit einem Würfelgitter.
This page was built for publication: Perfect codes in Cayley graphs of abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229202)