On Some Graphs Associated with Permutations

A permutation on the set X = {1, 2, ... , n} is a bijective function from X to itself. The set of all permutations on X is called the symmetric group and is denoted by Sym(n). An m-cyclic permutation is a permutation which moves m elements of X "cycle-wise" and does not move the other elements. For any 2