ABSTRACT
As can be found in any graph theory textbook, a graph G consists of a pair (V (G), E(G)), where V (G) (or simply V when there is no ambiguity) is the set of vertices and E(G) (or simply E when there is no ambiguity) is the set of edges. The cardinalities of V (G) and E(G) are often called the order and size of a graph G. In practice we often use |G| to denote |V (G)| (but not |E(G)|).
