Perfect codes in direct products of cycles-a complete characterization
From MaRDI portal
Recommendations
Cites work
- 1-perfect codes in Sierpiński graphs
- An almost complete description of perfect codes in direct products of cycles
- Characterizing r-perfect codes in direct products of two and three cycles
- Determinants and their applications in mathematical physics
- Error-correcting codes on the Towers of Hanoi graphs
- scientific article; zbMATH DE number 3552678 (Why is no real title available?)
- scientific article; zbMATH DE number 1124602 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 921905 (Why is no real title available?)
- scientific article; zbMATH DE number 975419 (Why is no real title available?)
- Isomorphic components of Kronecker product of bipartite graphs
- Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
- Perfect codes in graphs
- Perfect codes over graphs
- Perfect r-domination in the Kronecker product of three cycles
- Regular codes in regular graphs are difficult
Cited in
(23)- Characterizing r-perfect codes in direct products of two and three cycles
- Cyclotomic graphs and perfect codes
- Perfect codes in power graphs of finite groups
- Perfect codes in Cayley sum graphs
- Perfect codes in direct graph bundles
- Identifying codes of degree 4 Cayley graphs over abelian groups
- Efficient closed domination in digraph products
- Total perfect codes in Cayley graphs
- scientific article; zbMATH DE number 5543260 (Why is no real title available?)
- Perfect codes in some products of graphs
- Dominating sequences in grid-like and toroidal graphs
- Perfect codes in proper reduced power graphs of finite groups
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- Perfect codes and universal adjacency spectra of commuting graphs of finite groups
- The (non-)existence of perfect codes in Fibonacci cubes
- On perfect codes in Cartesian products of graphs
- On graph-based codes over Ramanujan graphs: existence and design of infinite families
- Lower bounds for the domination number and the total domination number of direct product graphs
- Perfect codes and total perfect codes in intersection graphs of finite groups
- Subgroup perfect codes in the semi-dihedral groups
- New characterization of efficient closed and open dominated graphs
- Subgroup perfect codes in Cayley sum graphs
- An almost complete description of perfect codes in direct products of cycles
This page was built for publication: Perfect codes in direct products of cycles-a complete characterization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q931836)
