Self-complementary graph

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.

Source: Wikipedia — Self-complementary graph (CC BY-SA 4.0)

Self-complementary graph

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.

This neuron ends here.

Source: Wikipedia "Self-complementary graph" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy