Self-complementary graph: Difference between revisions

Content deleted Content added
m Graph (mathematics) is now a disambiguation link; please fix., replaced: graphgraph{{dn|{{subst:DATE}}}} using AWB
m Fixing links to disambiguation pages, replaced: graph{{dn|date=January 2016}} → graph using AWB
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 (discrete 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==