Groups all of whose undirected Cayley graphs are determined by their spectra
Alireza Abdollahi, Shahrooz Janbaz, Mojtaba Jazaeri

TL;DR
This paper investigates finite groups whose Cayley graphs are uniquely determined by their spectra, proving all such groups are solvable with cyclic Sylow p-subgroups for p ≥ 5, and provides examples of non-Cayley-DS solvable groups.
Contribution
It establishes that all finite DS groups are solvable, characterizes Sylow p-subgroups in DS groups, and constructs infinite families of solvable groups that are not Cay-DS.
Findings
All finite DS groups are solvable.
Sylow p-subgroups of finite DS groups are cyclic for p ≥ 5.
Existence of non-Cay-DS solvable groups with specific properties.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
