Self-complementary graph: Difference between revisions

Revision as of 08:01, 7 January 2008

Revision as of 04:39, 8 January 2008

Line 1:

[[Image:Self-complementary NZ graph.svg|thumb|A self-complementary graph: the blue N is isomorphic to its complement, the dashed red Z.]]

A '''self-complementary graph''' is a [[graph (mathematics)|graph]] which is [[graph isomorphism|isomorphic]] to its [[graph complement|complement]]. The simplest self-complementary graphs are the 4-vertex [[path graph]] and the 5-vertex [[cycle graph]].