Vol. 6, No. 1, 2013

Download this article
Download this article For screen
For printing
Recent Issues

Volume 11, 1 issue

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
Cover Page
Editorial Board
Editors’ Addresses
Editors’ Interests
About the Journal
Scientific Advantages
Submission Guidelines
Submission Form
Ethics Statement
Editorial Login
Author Index
Coming Soon
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Properties of generalized derangement graphs

Hannah Jackson, Kathryn Nyman and Les Reid

Vol. 6 (2013), No. 1, 25–33

A permutation on n elements is called a k-derangement (k n) if no k-element subset is mapped to itself. One can form the k-derangement graph on the set of all permutations on n elements by connecting two permutations σ and τ if στ1 is a k-derangement. We characterize when such a graph is connected or Eulerian. For  n an odd prime power, we determine the independence, clique and chromatic numbers of the 2-derangement graph.

derangements, Eulerian, chromatic number, maximal clique, Cayley graph, independent set
Mathematical Subject Classification 2010
Primary: 05C69, 05A05
Secondary: 05C45
Received: 14 September 2011
Revised: 22 May 2012
Accepted: 13 July 2012
Published: 23 June 2013

Communicated by Ann Trenk
Hannah Jackson
Mathematics Department
Syracuse University
215 Carnegie
Syracuse, NY 13244
United States
Kathryn Nyman
Mathematics Department
Willamette University
900 State Street
Salem, OR 97301
United States
Les Reid
Mathematics Department
Missouri State University
901 South National Avenue
Springfield, MO 65897
United States