Content deleted Content added
→Self-complementary graphs and graph classes: No classification. |
|||
Line 53:
{{main|Self-complementary graph}}
A [[self-complementary graph]] is a graph that is [[graph isomorphism|isomorphic]] to its own complement.<ref name="bm"/> Examples include the four-vertex [[path graph]] and five-vertex [[cycle graph]]. There is no known characterization of self-complementary graphs.
Several classes of graphs are self-complementary, in the sense that the complement of any graph in one of these classes is another graph in the same class.
| |||