Edge-transitive almost self-complementary graphs

A graph is called almost self-complementary if it is isomorphic to the graph obtained from its complement by removing a 1-factor. In this paper, a complete classification is given of edge-transitive almost self-complementary graphs. This is then used to answer some open questions reported in the literature.