Definition:Graph (Graph Theory)/Size

From ProofWiki
Jump to: navigation, search

Definition

Let $G = \left({V, E}\right)$ be a graph.

The size of $G$ is the count of its edges.


That is, the size of a graph $G = \left({V, E}\right)$ is $\left \vert {E}\right \vert$.


Also see

A size zero graph is called an edgeless graph.


Sources