Null graph

Wikipedia, the free encyclopedia - Cite This Source

The null graph or the empty graph is either the graph with no vertices and no edges, or any graph with no edges. The null graph (in the former sense) is the initial object in the category of graphs, according to some definitions of a category of graphs.

Having no vertices, the null graph therefore also has no connected components. Thus, although the null graph is a forest (a graph with no cycles), it is not a tree, as trees have one connected component.

See also

• Glossary of graph theory

References

• Harary, F. and Read, R. (1973), "Is the null graph a pointless concept?", Graphs and Combinatorics (Conference, George Washington University), Springer-Verlag, New York, NY.

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)
This article is licensed under the GNU Free Documentation License.
Last updated on Tuesday January 15, 2008 at 14:43:29 PST (GMT -0800)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation