2012
DOI: 10.1016/j.laa.2012.03.033
|View full text |Cite
|
Sign up to set email alerts
|

Spectrum of Cayley graphs on the symmetric group generated by transpositions

Abstract: For an integer n ≥ 2, let X n be the Cayley graph on the symmetric group S n generated by the set of transpositions {(1 2), (1 3), . . . , (1 n)}. It is shown that the spectrum of X n contains all integers from −(n − 1) to n − 1 (except 0 if n = 2 or n = 3).

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(16 citation statements)
references
References 6 publications
0
16
0
Order By: Relevance
“…It was conjectured by Abdollahi and Vatandoost [1] that the eigenvalues of Γ(S n , Cy(2)) are integers, and contains all integers in the range from −(n − 1) to n − 1 (with the sole exception that when n = 2 or 3, zero is not an eigenvalue of Γ(S n , Cy(2)). The second part of the conjecture was proved by Krakovski and Mohar [17]. In fact, they showed that for n ≥ 2 and each integer 1 ≤ l ≤ n − 1, ±(n − l) are eigenvalues of Γ(S n , Cy(2)) with multiplicity at least n−2 l−1 .…”
Section: Cayley Graphsmentioning
confidence: 94%
See 2 more Smart Citations
“…It was conjectured by Abdollahi and Vatandoost [1] that the eigenvalues of Γ(S n , Cy(2)) are integers, and contains all integers in the range from −(n − 1) to n − 1 (with the sole exception that when n = 2 or 3, zero is not an eigenvalue of Γ(S n , Cy(2)). The second part of the conjecture was proved by Krakovski and Mohar [17]. In fact, they showed that for n ≥ 2 and each integer 1 ≤ l ≤ n − 1, ±(n − l) are eigenvalues of Γ(S n , Cy(2)) with multiplicity at least n−2 l−1 .…”
Section: Cayley Graphsmentioning
confidence: 94%
“…, n} and S ⊆ S n be closed under conjugation. Since In general, if S is not closed under conjugation, then the eigenvalues of Γ(S n , S) may not be integers [13] (see also [1,17,20] for related results on the eigenvalues of certain Cayley graphs). Problem 1.3.…”
Section: Cayley Graphsmentioning
confidence: 99%
See 1 more Smart Citation
“…They verified this conjecture numerically using GAP for n 6. In 2012, Krakovski and Mohar [14] proved the second part of the conjecture. More precisely, they proved that for n 2 and for each integer 1 k n − 1, the values ±(n − k) are eigenvalues of S n with multiplicity at least n−2 k−1 .…”
Section: Introductionmentioning
confidence: 99%
“…We note here that A(n, k, 1) was first introduced in [4] as an interconnection network model for parallel computation. Furthermore, A(n, k, 1) is called the partial permutation graph by Krakovski and Mohar in [13]. The eigenvalues of the arrangement graphs A(n, k, 1) were first studied in [2] by using a method developed by Godsil and McKay [10].…”
Section: Introductionmentioning
confidence: 99%