Null graph

From Wikipedia, the free encyclopedia

Null graph
Vertices	0
Edges	0
Automorphisms	1
This box: view • talk • edit

The null graph or the empty graph is either the graph with no vertices and (hence) 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.

[edit] Edgeless graph

Edgeless graph
Vertices	n
Edges	0
Automorphisms	n!
This box: view • talk • edit

Some authors feel that a better term for the latter sense—(V, { }) for any set V—is the more explicit edgeless graph. This reserves the term null graph for the former sense: a graph without even any vertices. Still others make this distinction by applying the label empty to these graphs with no edges.^{[1] [2]}

[edit] See also

• Glossary of graph theory
• Cycle graph
• Path graph
• Complete graph

[edit] 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.