Revision as of 23:13, 7 May 2013 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,817 edits →Examples: actually it's the rook's graph (4-regular) that is self-complementary, not the grid graph ← Previous edit		Revision as of 14:37, 31 January 2016 edit undo BD2412 (talk \| contribs) Autopatrolled, Administrators 2,529,169 edits m Graph (mathematics) is now a disambiguation link; please fix., replaced: graph → graph{{dn\|{{subst:DATE}}}} using AWB Next edit →
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~~Graph (mathematics)\|graph]]{{dn\|date=January 2016}} which is [[graph isomorphism\|isomorphic]] to its [[graph complement\|complement]]. The simplest non-trivial self-complementary graphs are the 4-vertex [[path graph]] and the 5-vertex [[cycle graph]]. ==Examples==

Self-complementary graph: Difference between revisions