| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654014 | European Journal of Combinatorics | 2011 | 6 Pages |
Abstract
Assuming the existence of a partition in perfect codes of the vertex set of a finite or infinite bipartite graph GG we give the construction of a perfect code in the Cartesian product G□G□P2G□G□P2. Such a partition is easily obtained in the case of perfect codes in Abelian Cayley graphs and we give some examples of applications of this result and its generalizations.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Michel Mollard,