Groups all of whose undirected Cayley graphs are determined by their spectra
arXiv:1503.01541
Abstract
Let be a finite group, and be a subset of such that . Suppose that is the Cayley graph on with respect to the set which is the graph whose vertex set is and two vertices are adjacent if and only if . The adjacency spectrum of a graph is the multiset of eigenvalues of its adjacency matrix. A graph is called "determined by its spectrum" (or for short DS) whenever if a graph has the same spectrum as , then . We say that the group is DS (Cay-DS, respectively) whenever if is a Cayley graph over and for some graph (Cayley graph, respectively) , then . In this paper, we study finite DS groups and finite Cay-DS groups. In particular we prove that all finite DS groups are solvable and all Sylow -subgroups of a finite DS group is cyclic for all . We also give several infinite families of non Cay-DS solvable groups. In particular we prove that there exist two cospectral non-isomorphic -regular Cayley graphs on the dihedral group of order for any prime .
The proof of Proposition 2.1 is corrected. The proof of Theorem 2.4 is corrected