English

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

Combinatorics 2018-08-07 v2

Abstract

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

Keywords

Cite

@article{arxiv.1808.01118,
  title  = {The second eigenvalue of some normal Cayley graphs of high transitive groups},
  author = {Xueyi Huang and Qiongxiang Huang and Sebastian M. Cioabă},
  journal= {arXiv preprint arXiv:1808.01118},
  year   = {2018}
}

Comments

26 pages

R2 v1 2026-06-23T03:23:36.172Z