English

A formula for eigenvalues of integral Cayley graphs over abelian groups

Combinatorics 2024-11-12 v1

Abstract

Let ZZ be an abelian group, xZ x \in Z, and [x]={y:x=y}[x] = \{ y : \langle x \rangle = \langle y \rangle \}. A graph is called integral if all its eigenvalues are integers. It is known that a Cayley graph is integral if and only if its connection set can be express as union of the sets [x][x] . In this paper, we determine an algebraic formula for eigenvalues of the integral Cayley graph when the connection set is [x] [x]. This formula involves an analogue of Mo¨\ddot{\text{o}}bius function.

Keywords

Cite

@article{arxiv.2411.06386,
  title  = {A formula for eigenvalues of integral Cayley graphs over abelian groups},
  author = {Priya and Monu Kadyan},
  journal= {arXiv preprint arXiv:2411.06386},
  year   = {2024}
}
R2 v1 2026-06-28T19:54:38.247Z