Perfect codes in direct products of cycles-a complete characterization
From MaRDI portal
Publication:931836
DOI10.1016/j.aam.2007.04.006zbMath1214.94084MaRDI QIDQ931836
Publication date: 26 June 2008
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2007.04.006
94B60: Other types of codes
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Perfect codes in proper reduced power graphs of finite groups, The (non-)existence of perfect codes in Fibonacci cubes, Total perfect codes in Cayley graphs, Dominating sequences in grid-like and toroidal graphs, Graphs that are simultaneously efficient open domination and efficient closed domination graphs, On perfect codes in Cartesian products of graphs, Lower bounds for the domination number and the total domination number of direct product graphs, Subgroup perfect codes in Cayley sum graphs, Cyclotomic graphs and perfect codes, Perfect codes in power graphs of finite groups, Perfect codes in direct graph bundles, Identifying codes of degree 4 Cayley graphs over abelian groups, Efficient closed domination in digraph products
Cites Work
- An almost complete description of perfect codes in direct products of cycles
- Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
- Characterizing \(r\)-perfect codes in direct products of two and three cycles
- Perfect codes over graphs
- Determinants and their applications in mathematical physics
- Regular codes in regular graphs are difficult
- Error-correcting codes on the Towers of Hanoi graphs
- Perfect codes in graphs
- Isomorphic components of Kronecker product of bipartite graphs
- 1-perfect codes in Sierpiński graphs
- Perfect r-domination in the Kronecker product of three cycles
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
