Near automorphisms of cycles

Abstract: Let be a permutation of . Define and over all the unordered pairs of distinct vertices of G. Let denote the smallest positive value of among all the permutations f of . The permutation f with is called a near automorphism of G. In this paper, we study the near automorphisms of cycles and we prove that , moreover, we obtain the set of near automorphisms of . [Copyright &y& Elsevier]