Characterizing \(r\)-perfect codes in direct products of two and three cycles

DOI10.1016/j.ipl.2004.12.010zbMath1177.94202OpenAlexW2171359428MaRDI QIDQ1041710

Simon Špacapan, Janja Jerebic, Sandi Klavžar

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.12.010

zbMATH Keywords

combinatorial problemserror-correcting codesdirect products of graphsperfect \(r\)-domination

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items

A Taxonomy of Perfect Domination, An almost complete description of perfect codes in direct products of cycles, Efficient closed domination in digraph products, Perfect codes in direct products of cycles-a complete characterization, Perfect codes in direct graph bundles, Perfect codes in direct products of cycles

Cites Work

• Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
• Variations on tilings in the Manhattan metric
• Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity
• Factoring cardinal product graphs in polynomial time
• Error-correcting codes on the Towers of Hanoi graphs
• The Kronecker Product of Graphs
• Diagonal and toroidal mesh networks
• 1-perfect codes in Sierpiński graphs
• Perfect r-domination in the Kronecker product of three cycles
• Perfect Codes in the Lee Metric and the Packing of Polyominoes
• Cardinal multiplication of structures with a reflexive relation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item