A bijective function (one to one correspondence) from a set to itself is also called a permutation.

the number of permutation on a set with n different elements is equal to n! thus the number of different one to one correspondence that could be listed between two regular n-gons is n!