On perfect codes in Cartesian products of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3831840 (Why is no real title available?)
- scientific article; zbMATH DE number 5543260 (Why is no real title available?)
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 1153450 (Why is no real title available?)
- scientific article; zbMATH DE number 3272069 (Why is no real title available?)
- scientific article; zbMATH DE number 3321827 (Why is no real title available?)
- 1-perfect codes in Sierpiński graphs
- A Combinatorial Construction of Perfect Codes
- A survey of perfect codes
- An almost complete description of perfect codes in direct products of cycles
- Efficient dominating sets in Cayley graphs.
- Error detecting and error correcting codes
- Error-correcting codes on the Towers of Hanoi graphs
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- Perfect r-codes in lexicographic products of graphs.
- Perfect codes in Cartesian products of 2-paths and infinite paths
- Perfect codes in direct products of cycles-a complete characterization
- Perfect codes in graphs
- Perfect codes over graphs
- Polarities of generalized hexagons and perfect codes
- Two infinite classes of perfect codes in metrically regular graphs
- Variations on tilings in the Manhattan metric
- q-coverings, codes and line graphs
Cited in
(28)- Perfect codes in Cartesian products of hypercube and multidimensional grid
- Perfect codes in Cartesian products of 2-paths and infinite paths
- Steganographic schemes from perfect codes on Cayley graphs
- New results on variants of covering codes in Sierpiński graphs
- Total and paired domination stability in prisms
- Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
- Perfect codes in proper intersection power graphs of finite groups
- Efficient absorbants in generalized de Bruijn digraphs
- On efficient absorbant conjecture in generalized de Bruijn digraphs
- Identifying codes of Cartesian product of two cliques of the same size
- Perfect codes in 2-valent Cayley digraphs on abelian groups
- The (non-)existence of perfect codes in Fibonacci cubes
- On graph-based codes over Ramanujan graphs: existence and design of infinite families
- scientific article; zbMATH DE number 921905 (Why is no real title available?)
- Total perfect codes in Cayley graphs
- Efficient domination in cubic vertex-transitive graphs
- Parameterized complexity of minimum membership dominating set
- Perfect codes in proper reduced power graphs of finite groups
- Subgroup perfect codes in Cayley sum graphs
- Common extremal graphs for three inequalities involving domination parameters
- scientific article; zbMATH DE number 5543260 (Why is no real title available?)
- Perfect codes and universal adjacency spectra of commuting graphs of finite groups
- Perfect codes in power graphs of finite groups
- Perfect codes in Cayley sum graphs
- On connected components and perfect codes of proper order graphs of finite groups
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- Efficient closed domination in digraph products
- Injective coloring of graphs revisited
This page was built for publication: On perfect codes in Cartesian products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627927)
