On Cayley representations of finite graphs over abelian p-groups

Abstract

We construct a polynomial-time algorithm which given a graph $\Gamma$ finds the full set of non-equivalent Cayley representations of $\Gamma$ over the group $D\cong C_p\times C_{p^k}$, where $p\in \{2,3\}$ and $k\ge 1$. This result implies that the recognition and the isomorphism problems for Cayley graphs over $D$ can be solved in polynomial time.

21 pages

References in corpus (2)

• Recognizing and testing isomorphism of Cayley graphs over an abelian group of order $4p$ in polynomial time
• On Schur p-groups of odd order

Cited by in corpus (1)

• On Cayley representations of central Cayley graphs over almost simple groups