Definition:Graph (Graph Theory)/Size

From ProofWiki
Jump to navigation Jump to search

Definition

Let $G = \struct {V, E}$ be a graph.

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


That is, the size of a graph $G = \struct {V, E}$ is $\card E$.


Also see

A size zero graph is called an edgeless graph.


Sources