1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.jcta.2009.10.002
DC FieldValue
dc.titleEigenvalues of the derangement graph
dc.contributor.authorKu, C.Y.
dc.contributor.authorWales, D.B.
dc.date.accessioned2014-10-28T02:34:23Z
dc.date.available2014-10-28T02:34:23Z
dc.date.issued2010-04
dc.identifier.citationKu, 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
dc.identifier.issn00973165
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/103193
dc.description.abstractWe 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.jcta.2009.10.002
dc.sourceScopus
dc.subjectCayley graph
dc.subjectDerangement
dc.subjectEigenvalue
dc.subjectSymmetric group
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1016/j.jcta.2009.10.002
dc.description.sourcetitleJournal of Combinatorial Theory. Series A
dc.description.volume117
dc.description.issue3
dc.description.page289-312
dc.description.codenJCBTA
dc.identifier.isiut000275344700005
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.