Given two regular graphs with consistent rotation maps, we produce a constructive method for a consistent rotation map on their Cartesian product. This method will be given as a simple set of rules of addition and table look ups. We assume that the combinatorial construction of both consistent rotation maps has occurred before we construct the Cartesian product.

中文翻译：

---

关于图笛卡尔积一致旋转图的一个注记

给定两个带有一致旋转图的正则图，我们为它们的笛卡尔积上的一致旋转图产生了一种构造方法。该方法将作为一组简单的加法和表查找规则给出。我们假设在构造笛卡尔乘积之前已经发生了两个一致的旋转图的组合构造。