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:
“In this Journal, my pen is a delicate needle point, tracing out a graph of temperament so as to show its daily fluctuations: grave and gay, up and down, lamentation and revelry, self-love and self-disgust. You get here all my thoughts and opinions, always irresponsible and often contradictory or mutually exclusive, all my moods and vapours, all the varying reactions to environment of this jelly which is I.”
—W.N.P. Barbellion (1889–1919)