English

Spectrum of the Transposition graph

Combinatorics 2022-09-27 v1

Abstract

Transposition graph TnT_n is defined as a Cayley graph over the symmetric group generated by all transpositions. It is known that all eigenvalues of TnT_n are integers. However, an explicit description of the spectrum is unknown. In this paper we prove that for any integer k0k\geqslant 0 there exists n0n_0 such that for any nn0n\geqslant n_0 and any m{0,,k}m \in \{0, \dots, k\}, mm is an eigenvalue of TnT_n. In particular, it is proved that zero is an eigenvalue of TnT_n for any n2n\neq2, and one is an eigenvalue of TnT_n for any odd n7n\geqslant 7 and for any even n14n \geqslant 14. We also present exact values of the third and the fourth largest eigenvalues of TnT_n with their multiplicities.

Keywords

Cite

@article{arxiv.2204.03153,
  title  = {Spectrum of the Transposition graph},
  author = {Elena V. Konstantinova and Artem Kravchuk},
  journal= {arXiv preprint arXiv:2204.03153},
  year   = {2022}
}
R2 v1 2026-06-24T10:40:35.980Z