Elsevier

Discrete Mathematics

Volume 247, Issues 1–3, 28 March 2002, Pages 107-116
Discrete Mathematics

On the Cayley isomorphism problem

https://doi.org/10.1016/S0012-365X(01)00164-9Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper, we prove several results on the Cayley isomorphism problem concerning undirected graphs. Let ϕ be Euler's phi function. The main result is the following theorem. Let q1,…,qs be distinct primes and p a prime such that p2<q1 and p2q1qi<qi+1 for all 1⩽is−1. Let n=q1qs. If gcd(np,ϕ(np))=1, then Zp2×Zn is a CI-group with respect to graphs.

Keywords

Cayley graph
Isomorphism
Cayley isomorphism
Abelian group

Cited by (0)