Enumeration of Cayley graphs over a nonabelian group of order $8p$

Abstract

Let $T_{8p}=⟨a,b\mid a^{2p}=b^8=e,a^p=b^4,b^{-1}ab=a^{-1}⟩$ be a nonabelian group of order $8p$, where $p$ is an odd prime number. In this paper, we give the formula to calculate the number of Cayley graphs over $T_{8p}$ up to isomorphism by using the Pólya Enumeration Theorem. Moreover, we get the formula to calculate the number of connected Cayley graphs over $T_{8p}$ by deleting the disconnected graphs. By applying the results, we list the exact number of (connected) Cayley graphs for $3\le p\le 13$.