On perfect codes in Cartesian product of graphs - Archive ouverte HAL
Article Dans Une Revue European Journal of Combinatorics Année : 2011

On perfect codes in Cartesian product of graphs

Michel Mollard

Résumé

Assuming the existence of a partition in perfect codes of the vertex set of a finite or infinite bipartite graph $G$ we give the construction of a perfect code in the Cartesian product $ G \Box G \Box P_2$. Such a partition is easily obtained in the case of perfect codes in Abelian Cayley graphs and we give some example of applications of this result and its generalizations.
Fichier principal
Vignette du fichier
codeproduct_revise.pdf (141.53 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00535682 , version 1 (12-11-2010)

Identifiants

  • HAL Id : hal-00535682 , version 1

Citer

Michel Mollard. On perfect codes in Cartesian product of graphs. European Journal of Combinatorics, 2011, 32 (3), pp.398-403. ⟨hal-00535682⟩

Collections

CNRS FOURIER INSMI
86 Consultations
351 Téléchargements

Partager

More