Difference between revisions of "Null graph"
MyWikiBiz, Author Your Legacy — Thursday December 05, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) (copy text from [http://www.opencycle.net/ OpenCycle] of which Jon Awbrey is the sole author) |
Jon Awbrey (talk | contribs) (+ {{aficionados}} <sharethis />) |
||
Line 4: | Line 4: | ||
* [[Frank Harary|Harary, F.]] and Read, R., "Is the Null Graph a Pointless Concept?", ''Graphs and Combinatorics Conference'', George Washington University, Springer-Verlag, New York, NY, 1973. | * [[Frank Harary|Harary, F.]] and Read, R., "Is the Null Graph a Pointless Concept?", ''Graphs and Combinatorics Conference'', George Washington University, Springer-Verlag, New York, NY, 1973. | ||
+ | |||
+ | {{aficionados}}<sharethis /> | ||
[[Category:Combinatorics]] | [[Category:Combinatorics]] |
Revision as of 17:51, 21 May 2007
The null graph or the empty graph is the graph with no points and no lines.
Reference
- Harary, F. and Read, R., "Is the Null Graph a Pointless Concept?", Graphs and Combinatorics Conference, George Washington University, Springer-Verlag, New York, NY, 1973.
Aficionados
- See Talk:Null graph for discussions/comments regarding this article.
- See Null graph/Aficionados for those who have listed Null graph as an interest.
- See Talk:Null graph/Aficionados for discussions regarding this interest.
<sharethis />