Definition:Size (Graph Theory)
From ProofWiki
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$.
A size zero graph is called an edgeless graph.
Sources
- Gary Chartrand: Introductory Graph Theory (1977): $\S 1.3$
