![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/e/e8/Self-complementary_NZ_graph.svg/640px-Self-complementary_NZ_graph.svg.png&w=640&q=50)
Self-complementary graph
Graph which is isomorphic to its complement / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Self-complementary graph?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In the mathematical field of graph theory, a self-complementary graph is a graph which is isomorphic to its complement. The simplest non-trivial self-complementary graphs are the 4-vertex path graph and the 5-vertex cycle graph. There is no known characterization of self-complementary graphs.
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/e/e8/Self-complementary_NZ_graph.svg/220px-Self-complementary_NZ_graph.svg.png)
Graph A
Graph complement of A
Graph A is isomorphic to its complement.