Complement graph: Difference between revisions

Revision as of 23:56, 10 February 2016

Revision as of 00:04, 11 February 2016

Line 62:

==Self-complementary graphs and graph classes==

{{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]].