On the graceful permutation graphs conjecture
Na Han, Zhihe Liang · Journal of Discrete Mathematical Sciences and Cryptography · 2008
S. M. Lee proposed the conjecture: for any n>1 and any permutation f in S(n), the permutation graph P(P n , f) is graceful. For any integer n>1 and some permutations f in S(n), we discuss gracefulness of the permutation graphs P(P n , f).