Self-complementary graph: Difference between revisions

Content deleted Content added
m Fixing links to disambiguation pages, replaced: graph{{dn|date=January 2016}} → graph using AWB
Examples: +source
Line 24:
| year = 1982}}.</ref>
 
The [[Rado graph]] is an infinite self-complementary graph.<ref>{{citation
| last = Cameron | first = Peter J. | authorlink = Peter Cameron (mathematician)
| contribution = The random graph
| mr = 1425227
| ___location = Berlin
| pages = 333–351
| publisher = Springer
| series = Algorithms Combin.
| title = The mathematics of Paul Erdős, II
| volume = 14
| arxiv = 1301.7544
| year = 1997}}. See in particular Proposition 5.</ref>
 
==Properties==