The second eigenvalue of some normal Cayley graphs of high transitive groups
Abstract
Let be a finite group acting transitively on [n]=\1,2,…,n\, and let G=Cay(,T) be a Cayley graph of . 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 Sn and we determine the second eigenvalues of a majority of the connected normal Cayley graphs (and some of their subgraphs) of Sn with τ∈ T|supp(τ)|≤ 5, where supp(τ) is the set of points in [n] non-fixed by τ.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.