Difference between revisions of "Null graph"
MyWikiBiz, Author Your Legacy — Friday November 29, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) (+ {{aficionados}} <sharethis />) |
Jon Awbrey (talk | contribs) (delete obsolete tag) |
||
| (One intermediate revision by the same user not shown) | |||
| 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. | ||
| − | |||
| − | |||
[[Category:Combinatorics]] | [[Category:Combinatorics]] | ||
Latest revision as of 20:10, 31 August 2017
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.
