Revision as of 00:32, 11 February 2016 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,811 edits m →Formal construction: more math ← Previous edit		Revision as of 00:32, 11 February 2016 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,811 edits →Formal construction: simpler heading Next edit →
Line 10: \| page = 6}}.</ref> It is not, however, the [[complement (set theory)\|set complement]] of the graph; only the edges are complemented. ==Definition== ~~==Formal construction==~~ Let {{math\|1=''G'' = (''V'', ''E'')}} be a [[simple graph]] and let {{mvar\|K}} consist of all 2-element subsets of {{mvar\|V}}. Then {{math\|1=''H'' = (''V'', ''K'' \ ''E'')}} is the complement of {{mvar\|G}}.<ref>{{Citation \| last=Diestel \| first=Reinhard

Complement graph: Difference between revisions