size (of a graph)

The size of a graph $G$ is the number of edges in $G$; it is denoted by $e(G)$. $G(n,m)$ denotes an arbitrary graph of order n and size m.

Adapted with permission of the author from by Béla Bollobás, published by Springer-Verlag New York, Inc., 1998.