Spectra of Cayley graphs
Group Theory
2020-08-26 v1 Combinatorics
Representation Theory
Abstract
Let be a group and its subset such that , where . Then {\it the Cayley graph } is an undirected graph with the vertex set and the edge set . A graph is said to be {\it integral} if every eigenvalue of the adjacency matrix of is integer. In the paper, we prove the following theorem: {\it if a subset of is normal and for every such that , then is integral.} In particular, {\it if is a normal set of involutions, then is integral.} We also use the theorem to prove that {\it if and , then is integral.} Thus, we give positive solutions for both problems 19.50(a) and 19.50(b) in "Kourovka Notebook".
Cite
@article{arxiv.1808.01391,
title = {Spectra of Cayley graphs},
author = {Wenbin Guo and Daria V. Lytkina and Victor D. Mazurov and Danila O. Revin},
journal= {arXiv preprint arXiv:1808.01391},
year = {2020}
}
Comments
in Russian