Edgeless Graph
| Edgeless graph (empty graph, null graph) | |
|---|---|
| Vertices | n |
| Edges | 0 |
| Radius | 0 |
| Diameter | 0 |
| Girth | |
| Automorphisms | n! |
| Chromatic number | 1 |
| Chromatic index | 0 |
| Genus | 0 |
| Properties | Integral Symmetric |
| Notation | |
For each natural number n, the edgeless graph (or empty graph) 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.
The n-vertex edgeless graph is the complement graph for the complete graph, and therefore it is commonly denoted as .
Read more about this topic: Null Graph
Famous quotes containing the word graph:
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)