The edge count of a graph , commonly denoted
or
and also called the graph size or edge number, is the number of edges in
.
In other words, it is the cardinality of the edge set.
The edge count of a graph is implemented in the Wolfram Language as EdgeCount[g]. The numbers of edges for many named graphs are given by the command GraphData[graph, "EdgeCount"].