On perfect codes in Cartesian products of graphs

DOI10.1016/j.ejc.2010.11.007zbMath1209.05207OpenAlexW2031805258MaRDI QIDQ627927

Michel Mollard

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

Mathematics Subject Classification ID

Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (18)

Perfect codes and universal adjacency spectra of commuting graphs of finite groups ⋮ Total perfect codes in Cayley graphs ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ Perfect codes in power graphs of finite groups ⋮ Efficient closed domination in digraph products ⋮ Injective coloring of graphs revisited ⋮ Efficient domination in cubic vertex-transitive graphs ⋮ Perfect codes in proper reduced power graphs of finite groups ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups ⋮ Parameterized complexity of minimum membership dominating set ⋮ The (non-)existence of perfect codes in Fibonacci cubes ⋮ Common extremal graphs for three inequalities involving domination parameters ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ Perfect codes in Cayley sum graphs ⋮ Steganographic schemes from perfect codes on Cayley graphs ⋮ Subgroup perfect codes in Cayley sum graphs

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

This page was built for publication: On perfect codes in Cartesian products of graphs