Groups all of whose undirected Cayley graphs are determined by their spectra

Abstract

The adjacency spectrum Spec(Γ) of a graph Γ is the multiset of eigenvalues of its adjacency matrix. Two graphs with the same spectrum are called cospectral. A graph Γ is "determined by its spectrum" (DS for short) if every graph cospectral to it is in fact isomorphic to it. A group is DS if all of its Cayley graphs are DS. A group G is Cay-DS if every two cospectral Cayley graphs of G are isomorphic. In this paper, we study finite DS groups and finite Cay-DS groups. In particular we prove that a finite DS group is solvable, and every non-cyclic Sylow subgroup of a finite DS group is of order 4, 8, 16 or 9. We also give several infinite families of non-Cay-DS solvable groups. In particular we prove that there exist two cospectral non-isomorphic 6-regular Cayley graphs on the dihedral group of order 2p for any prime p ≥ 13. © 2016 World Scientific Publishing Company.