Null graph
From Wikipedia, the free encyclopedia
| Null graph | |
| Vertices | 0 |
|---|---|
| Edges | 0 |
| Automorphisms | 1 |
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.
Contents |
[edit] Edgeless graph
| Edgeless graph | |
| Vertices | n |
|---|---|
| Edges | 0 |
| Automorphisms | n! |
| Notation |  |
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]
The n-vertex edgeless graph is the complement graph for the complete graph Kn, and therefore it is commonly denoted as .
Even though this definition provides a solid basis for defining certain operations on graphs (eg: decomposition) considering graphs as sets of vertices and edges (V, E) this definition raises a problem in uniqueness of the null element of graphs.
[edit] See also
[edit] Notes
[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.
.svg){kind=small}
