More on almost self-complementary graphs

Two perfect matchings I and J in Xc are said to be X-non-isomorphic if no isomorphism from X+I to X+J induces an automorphism of X. We give a constructive proof to show that there exists a graph X that is almost self-complementary with respect to two X-non-isomorphic perfect matchings for every even order greater than or equal to four.