1 Answers

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.

4 views

Related Questions

What is McKay graph?
1 Answers 5 Views
What is Crown graph?
1 Answers 4 Views
What is Archimedean graph?
1 Answers 5 Views
What is Heawood graph?
1 Answers 6 Views
What is Grassmann graph?
1 Answers 5 Views
What is Reeb graph?
1 Answers 4 Views
What is Diamond graph?
1 Answers 5 Views
What is Biconnected graph?
1 Answers 4 Views
What is Ladder graph?
1 Answers 4 Views