Construction of self-complementary graphs

Given a graph H with 2p vertices, the necessary and sufficient condition for the existence of a self-complementary graph G of order 4p containing a pair of edge disjoint subgraphs H1 and H2 such that H ≅ H1 and H ⋍ H2 is presented. An algorithm that generates all such self-complementary graphs is also presented.