Definition:Order (Graph Theory)
From ProofWiki
Definition
Let $G = \left({V, E}\right)$ be a graph.
The order of $G$ is the count of its vertices.
That is, the order of a graph $G = \left({V, E}\right)$ is $\left \vert {V}\right \vert$.
An order zero graph is the null graph.
Sources
- Gary Chartrand: Introductory Graph Theory (1977): $\S 1.3$
