Perfect codes in vertex-transitive graphs
From MaRDI portal
Publication:2689009
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- 50 Years of the Golomb--Welch Conjecture
- A survey of perfect codes
- A survey of perfect codes
- An improved version of Lloyd's theorem
- Characterization of subgroup perfect codes in Cayley graphs
- Codes and anticodes in the Grassman graph
- Cyclotomic graphs and perfect codes
- Efficient dominating sets in Cayley graphs.
- Efficient dominating sets in circulant graphs
- Efficient domination in cubic vertex-transitive graphs
- Independent perfect domination sets in Cayley graphs
- On perfect codes in the Hamming schemes H(n,q) with q arbitrary
- On subgroup perfect codes in Cayley graphs
- Perfect Codes in Antipodal Distance-Transitive Graphs.
- Perfect codes and related structures
- Perfect codes in Cayley graphs
- Perfect codes in circulant graphs
- Perfect codes in graphs
- Perfect codes in the graphs Ok and L(Ok)
- Perfect codes in the graphs \(O_k\)
- Perfect codes over graphs
- Subgroup Perfect Codes in Cayley Graphs
- Subgroups as efficient dominating sets in Cayley graphs
- The theory of finite groups. An introduction.
- Total perfect codes in Cayley graphs
- Vertex-transitive graphs: Symmetric graphs of prime valency
Cited in
(5)
This page was built for publication: Perfect codes in vertex-transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689009)