Spectrum of Cayley graphs on the symmetric group generated by transpositions
Roi Krakovski, Bojan Mohar

TL;DR
This paper investigates the spectral properties of a specific Cayley graph on the symmetric group generated by transpositions involving the first element, revealing that its spectrum includes all integers from -(n-1) to n-1, with some exceptions.
Contribution
It provides a complete description of the spectrum of Cayley graphs generated by transpositions on the symmetric group, highlighting the range of eigenvalues.
Findings
Spectrum contains all integers from -(n-1) to n-1
Zero is excluded from the spectrum for n=2 or n=3
Spectrum characterization applies to Cayley graphs generated by specific transpositions
Abstract
For an integer , let be the Cayley graph on the symmetric group generated by the set of transpositions . It is shown that the spectrum of contains all integers from to (except 0 if or ).
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.
Taxonomy
TopicsGraph theory and applications · Finite Group Theory Research · graph theory and CDMA systems
