Spectrum of the Transposition graph
Abstract
Transposition graph Tn is defined as a Cayley graph over the symmetric group generated by all transpositions. It is known that all eigenvalues of Tn are integers. However, an explicit description of the spectrum is unknown. In this paper we prove that for any integer k≥slant 0 there exists n0 such that for any n≥slant n0 and any m ∈ \0, …, k\, m is an eigenvalue of Tn. In particular, it is proved that zero is an eigenvalue of Tn for any n≠2, and one is an eigenvalue of Tn for any odd n≥slant 7 and for any even n ≥slant 14. We also present exact values of the third and the fourth largest eigenvalues of Tn with their multiplicities.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.