2019
DOI: 10.37236/8054
|View full text |Cite
|
Sign up to set email alerts
|

The Second Eigenvalue of some Normal Cayley Graphs of Highly 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 S n and we determine the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
13
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(13 citation statements)
references
References 34 publications
0
13
0
Order By: Relevance
“…The following lemma is straightforward and is given without a proof (see [8,Lemma 5]). Let G := Sym(n) and for any i ∈ {1, 2, .…”
Section: 2mentioning
confidence: 99%
See 2 more Smart Citations
“…The following lemma is straightforward and is given without a proof (see [8,Lemma 5]). Let G := Sym(n) and for any i ∈ {1, 2, .…”
Section: 2mentioning
confidence: 99%
“…, n}. If B Π i = (b s,t ) s,t∈{1,2,...,n} is the quotient matrix corresponding to the equitable partition Π i of Γ n,k given by G/G i , then by [8] b…”
Section: 2mentioning
confidence: 99%
See 1 more Smart Citation
“…Final NoteWe would like to mention the recent asymptotic results by O. Parzanchevski & Puder[15] and R. Maleki & A. S. Razafimahatratra[14] relating to Theorems 1.1 and 1.2. Furthermore, recently X. Huang, Q. Huang & S. M. Cioabȃ[7] have computed the second largest eigenvalue of some Cayley graphs for highly transitive permutation groups on the natural permutation module. One of the eigenvalues in Theorem 5.2 can also be determined by[7, Lemma 11].…”
mentioning
confidence: 99%
“…Furthermore, recently X. Huang, Q. Huang & S. M. Cioabȃ[7] have computed the second largest eigenvalue of some Cayley graphs for highly transitive permutation groups on the natural permutation module. One of the eigenvalues in Theorem 5.2 can also be determined by[7, Lemma 11].…”
mentioning
confidence: 99%