Definition:Graph (Graph Theory)/Order

From ProofWiki
Jump to navigation Jump to search

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


Also see

An order zero graph is the null graph.


Sources