Answers are grounded in this paper and cite their sources.
The Cartesian product of Cayley graphs is again a Cayley graph. For connected graphs, the converse question reduces to Cartesian powers of Cartesian-prime graphs, and consequently to the study of regular subgroups of wreath products in the product action. We prove that, for a transitive permutation group G of degree $2p$ or $4p$, where p is prime, G S₂ contains a regular subgroup if and only if G does, and construct counterexamples of degree $8p$ for every prime p≡34. By modifying this construction, we obtain an infinite family of connected non-Cayley graphs whose Cartesian squares are Cayley graphs, giving a negative answer to the converse question. The smallest graph in our family has $120$ vertices and valency $27$. In contrast, we prove that a connected vertex-transitive graph of order $pq$, where p and q are primes, has a Cayley Cartesian power if and only if the graph itself is Cayley.
No takes yet. Share an insight, caveat, or question.
Ding et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: