Involve: A Journal of Mathematics
- Volume 6, Number 1 (2013), 25-33.
Properties of generalized derangement graphs
A permutation on elements is called a -derangement () if no -element subset is mapped to itself. One can form the -derangement graph on the set of all permutations on elements by connecting two permutations and if is a -derangement. We characterize when such a graph is connected or Eulerian. For an odd prime power, we determine the independence, clique and chromatic numbers of the 2-derangement graph.
Involve, Volume 6, Number 1 (2013), 25-33.
Received: 14 September 2011
Revised: 22 May 2012
Accepted: 13 July 2012
First available in Project Euclid: 20 December 2017
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Jackson, Hannah; Nyman, Kathryn; Reid, Les. Properties of generalized derangement graphs. Involve 6 (2013), no. 1, 25--33. doi:10.2140/involve.2013.6.25. https://projecteuclid.org/euclid.involve/1513733554