On perfect codes in Cartesian product of graphs
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.
Domaines
Combinatoire [math.CO]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...