pith. sign in

arxiv: 1808.01118 · v2 · pith:3RBLJYHPnew · submitted 2018-08-03 · 🧮 math.CO

The second eigenvalue of some normal Cayley graphs of high transitive groups

classification 🧮 math.CO
keywords secondcayleyeigenvaluesgammagraphgraphsmathrmnormal
0
0 comments X
read the original abstract

Let $\Gamma$ be a finite group acting transitively on $[n]=\{1,2,\ldots,n\}$, and let $G=\mathrm{Cay}(\Gamma,T)$ be a Cayley graph of $\Gamma$. The graph $G$ is called normal if $T$ is closed under conjugation. In this paper, we obtain an upper bound for the second (largest) eigenvalue of the adjacency matrix of the graph $G$ in terms of the second eigenvalues of certain subgraphs of $G$ (see Theorem 2.6). Using this result, we develop a recursive method to determine the second eigenvalues of certain Cayley graphs of $S_n$ and we determine the second eigenvalues of a majority of the connected normal Cayley graphs (and some of their subgraphs) of $S_n$ with $\max_{\tau\in T}|\mathrm{supp}(\tau)|\leq 5$, where $\mathrm{supp}(\tau)$ is the set of points in $[n]$ non-fixed by $\tau$.

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.