Revision as of 23:57, 14 January 2010 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,886 edits vectorize ← Previous edit		Revision as of 23:58, 14 January 2010 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,886 edits →Applications and examples: self-complementary graph Next edit →
Line 6: ==Applications and examples== Several graph-theoretic concepts are related to each other via complement graphs. For example, the complement of an [[edgeless graph]] is a [[complete graph]] and vice versa. An [[independent set (graph theory)\|independent set]] in a graph is a [[clique (graph theory)\|clique]] in the complement graph and vice versa. The complement of any [[triangle-free graph]] is a [[claw-free graph]]. A [[self-complementary graph]] is a graph that is [[graph isomorphism\|isomorphic]] to its own complement. ==References==

Complement graph: Difference between revisions