On perfect codes in Cartesian products of graphs
From MaRDI portal
Publication:627927
DOI10.1016/j.ejc.2010.11.007zbMath1209.05207MaRDI QIDQ627927
Publication date: 4 March 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2010.11.007
05C90: Applications of graph theory
05C15: Coloring of graphs and hypergraphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C76: Graph operations (line graphs, products, etc.)
Related Items
On efficient absorbant conjecture in generalized De Bruijn digraphs, Perfect codes in proper reduced power graphs of finite groups, Common extremal graphs for three inequalities involving domination parameters, The (non-)existence of perfect codes in Fibonacci cubes, Perfect codes and universal adjacency spectra of commuting graphs of finite groups, Total perfect codes in Cayley graphs, Efficient domination in cubic vertex-transitive graphs, Graphs that are simultaneously efficient open domination and efficient closed domination graphs, Subgroup perfect codes in Cayley sum graphs, Perfect codes in power graphs of finite groups, Efficient absorbants in generalized de Bruijn digraphs, Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups, Perfect codes in Cayley sum graphs, Steganographic schemes from perfect codes on Cayley graphs, New results on variants of covering codes in Sierpiński graphs, Efficient closed domination in digraph products, Injective coloring of graphs revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An almost complete description of perfect codes in direct products of cycles
- Perfect codes in direct products of cycles-a complete characterization
- Perfect codes over graphs
- Two infinite classes of perfect codes in metrically regular graphs
- Polarities of generalized hexagons and perfect codes
- q-coverings, codes and line graphs
- Variations on tilings in the Manhattan metric
- Efficient dominating sets in Cayley graphs.
- Error-correcting codes on the Towers of Hanoi graphs
- Perfect codes in graphs
- Perfect codes in Cartesian products of 2-paths and infinite paths
- A Combinatorial Construction of Perfect Codes
- Error Detecting and Error Correcting Codes
- 1-perfect codes in Sierpiński graphs
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- A survey of perfect codes
