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

preprint2015arXivOpen access

Abstract

Let GG be a finite group, and SS be a subset of G∖{1}G\setminus\{1\} such that S=S−1S=S^{-1}. Suppose that Cay(G,S)Cay(G,S) is the Cayley graph on GG with respect to the set SS which is the graph whose vertex set is GG and two vertices a,b∈Ga,b\in G are adjacent if and only if ab−1∈Sab^{-1}\in S. The adjacency spectrum Spec(Γ)Spec(Γ) 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 Γ≅Γ′Γ\cong Γ'. We say that the group GG is DS (Cay-DS, respectively) whenever if ΓΓ is a Cayley graph over GG and Spec(Γ)=Spec(Γ′)Spec(Γ)=Spec(Γ') for some graph (Cayley graph, respectively) Γ′Γ', then Γ≅Γ′Γ\cong Γ'. 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 pp-subgroups of a finite DS group is cyclic for all p≥5p\geq 5. We also give several infinite families of non Cay-DS solvable groups. In particular we prove that there exist two cospectral non-isomorphic 66-regular Cayley graphs on the dihedral group of order 2p2p for any prime p≥13p\geq 13.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.