Spectra of Cayley graphs

Abstract

Let G be a group and S⊂eq G its subset such that S=S-1, where S-1=\s-1 s∈ S\. Then the Cayley graph Cay(G,S) is an undirected graph with the vertex set V()=G and the edge set E()=\(g,gs) g∈ G, s∈ S\. A graph is said to be integral if every eigenvalue of the adjacency matrix of is integer. In the paper, we prove the following theorem: if a subset S=S-1 of G is normal and s∈ S⇒ sk∈ S for every k∈ Z such that (k,|s|)=1, then Cay(G,S) is integral. In particular, if S⊂eq G is a normal set of involutions, then Cay(G,S) is integral. We also use the theorem to prove that if G=An and S=\(12i)1 i=3,…,n\, then Cay(G,S) is integral. Thus, we give positive solutions for both problems 19.50(a) and 19.50(b) in "Kourovka Notebook".

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…