Please use this identifier to cite or link to this item:
|Title:||Eigenvalues of the derangement graph||Authors:||Ku, C.Y.
|Issue Date:||Apr-2010||Citation:||Ku, C.Y., Wales, D.B. (2010-04). Eigenvalues of the derangement graph. Journal of Combinatorial Theory. Series A 117 (3) : 289-312. ScholarBank@NUS Repository. https://doi.org/10.1016/j.jcta.2009.10.002||Abstract:||We consider the Cayley graph on the symmetric group Sn generated by derangements. It is well known that the eigenvalues of this graph are indexed by partitions of n. We investigate how these eigenvalues are determined by the shape of their corresponding partitions. In particular, we show that the sign of an eigenvalue is the parity of the number of cells below the first row of the corresponding Ferrers diagram. We also provide some lower and upper bounds for the absolute values of these eigenvalues. © 2009 Elsevier Inc. All rights reserved.||Source Title:||Journal of Combinatorial Theory. Series A||URI:||http://scholarbank.nus.edu.sg/handle/10635/103193||ISSN:||00973165||DOI:||10.1016/j.jcta.2009.10.002|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.