> A self-complementary graph is a graph which is isomorphic to its graph complement.

i.e., if you add edges between nodes which aren't connected, and remove edges which are already there, you get back the graph you started with.