Encyclopedia of Graphs

Home
News
About
Sources
Privacy

× Due to file size constraints please use a filter to get less than 10000 results.

< Back to previous view

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

Update collection view

You can use logical expressions to narrow down the list of graphs in a collection. Examples

Using AND: girth >= 3 distance-regular = true "hamiltonian cycle" = false
Using OR: order != 6 and (bipartite = true or diameter < 3)
Similar match: "group order" ~ 2^10
Existence: set? "graph name"

Select properties:

Order

Size

Girth

Minimum degree

Maximum degree

Diameter

Radius

Bipartite

Vertex-transitive

Planar

Export all

Load more Load all

Collection comments

Only signed in users can post comments. Sign in here
Don't have an account yet? Register here

Our website uses cookies to enhance your user experience and for analytics. By using this site, you agree to our use of cookies. More details can be found in our privacy policy.