Cayley Graph on Symmetric Group Generated by Elements Fixing k Points
classification
🧮 math.CO
keywords
mathcalgrapheigenvaluesfixinggrouppointssymmetricapply
read the original abstract
Let $\mathcal{S}_{n}$ be the symmetric group on $[n]=\{1, \ldots, n\}$. The $k$-point fixing graph $\mathcal{F}(n,k)$ is defined to be the graph with vertex set $\mathcal{S}_{n}$ and two vertices $g$, $h$ of $\mathcal{F}(n,k)$ are joined if and only if $gh^{-1}$ fixes exactly $k$ points. In this paper, we derive a recurrence formula for the eigenvalues of $\mathcal{F}(n,k)$. Then we apply our result to determine the sign of the eigenvalues of $\mathcal{F}(n,1)$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.