Question

Why do self-complementary graphs need half the number of edges?

Answer 1

A self-complementary graph is a graph which is isomorphic to its graph complement. ... By definition, a self-complementary graph must have exactly half the total possible number of edges, i.e., edges for a self-complementary graph on vertices. Since must be divisible by 4, it follows that or 1 (mod 4).