Revision as of 09:26, 26 June 2016 edit HitroMilanese (talk \| contribs) Autopatrolled, Extended confirmed users, New page reviewers, Pending changes reviewers, Rollbackers 63,172 edits Reverted 1 edit by Mehrnaz76 (talk): Not this way. (TW) ← Previous edit		Revision as of 22:06, 17 August 2016 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,811 edits →Self-complementary graphs and graph classes: universal vertex Next edit →
Line 86: \| isbn = 0-12-289260-7 \| mr = 0562306}}.</ref> *The [[threshold graph]]s are the graphs formed by repeatedly adding either an independent vertex (one with no neighbors) or a [[universal vertex]] (adjacent to all previously-added vertices). These two operations are complementary and they generate a self-complementary class of graphs.<ref>{{citation \| last1 = Golumbic \| first1 = Martin Charles \| last2 = Jamison \| first2 = Robert E.

Complement graph: Difference between revisions