Null graph

Order-zero graph (null graph)
Vertices	0
Edges	0
Girth	${\displaystyle \infty }$
Automorphisms	1
Chromatic number	0
Chromatic index	0
Genus	0
Properties	Integral Symmetric Treewidth -1
Notation	${\displaystyle K_{0}}$
Table of graphs and parameters

The order-zero graph, ${\displaystyle K_{0}}$, is the unique graph having no vertices (hence its order is zero). It follows that ${\displaystyle K_{0}}$ also has no edges. Thus the null graph is a regular graph of degree zero. Some authors exclude ${\displaystyle K_{0}}$ from consideration as a graph (either by definition, or more simply as a matter of convenience). Whether including ${\displaystyle K_{0}}$ as a valid graph is useful depends on context. On the positive side, ${\displaystyle K_{0}}$ follows naturally from the usual set-theoretic definitions of a graph (it is the ordered pair (V, E) for which the vertex and edge sets, V and E, are both empty), in proofs it serves as a natural base case for mathematical induction, and similarly, in recursively defined data structures ${\displaystyle K_{0}}$ is useful for defining the base case for recursion (by treating the null tree as the child of missing edges in any non-null binary tree, every non-null binary tree has exactly two children). On the negative side, including ${\displaystyle K_{0}}$ as a graph requires that many well-defined formulas for graph properties include exceptions for it (for example, either "counting all strongly connected components of a graph" becomes "counting all non-null strongly connected components of a graph", or the definition of connected graphs has to be modified not to include K₀). To avoid the need for such exceptions, it is often assumed in literature that the term graph implies "graph with at least one vertex" unless context suggests otherwise.[1][2]

In category theory, the order-zero graph is, according to some definitions of "category of graphs," the initial object in the category.

${\displaystyle K_{0}}$ does fulfill (vacuously) most of the same basic graph properties as does ${\displaystyle K_{1}}$ (the graph with one vertex and no edges). As some examples, ${\displaystyle K_{0}}$ is of size zero, it is equal to its complement graph ${\displaystyle {\overline {K_{0}}}}$, a forest, and a planar graph. It may be considered undirected, directed, or even both; when considered as directed, it is a directed acyclic graph. And it is both a complete graph and an edgeless graph. However, definitions for each of these graph properties will vary depending on whether context allows for ${\displaystyle K_{0}}$.

Edgeless graph (empty graph, null graph)
Vertices	n
Edges	0
Radius	0
Diameter	0
Girth	${\displaystyle \infty }$
Automorphisms	n!
Chromatic number	1
Chromatic index	0
Genus	0
Properties	Integral Symmetric
Notation	${\displaystyle {\overline {K}}_{n}}$
Table of graphs and parameters

For each natural number n, the edgeless graph (or empty graph) ${\displaystyle {\overline {K}}_{n}}$ of order n is the graph with n vertices and zero edges. An edgeless graph is occasionally referred to as a null graph in contexts where the order-zero graph is not permitted.[1][2]

It is a 0-regular graph. The notation ${\displaystyle {\overline {K}}_{n}}$ arises from the fact that the n-vertex edgeless graph is the complement of the complete graph ${\displaystyle K_{n}}$.

• Glossary of graph theory
• Cycle graph
• Path graph

Wikimedia Commons has media related to Null graphs.

• 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.