Self-complementary graphs
Last update: 15 Dec 2020 | Contains: 710130 graphs
A self-complementary graph is one isomorphic to its complement. Such graphs can only have orders congruent to 0 or 1 modulo 4. Every self-complementary graph is connected and has a diameter of 2 or 3. The following collection was calculated by Brendan McKay (source) and lists all self-complementary graphs up to 16 vertices.
OEIS: A000171