[Go to site: main page, start]

TOPICS
Search

Edge Count


The edge count of a graph g, commonly denoted M(g) or E(g) and also called the graph size or edge number, is the number of edges in g. 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"].


See also

Edge Set, Graph Edge, Graph Order, Vertex Count

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Edge Count." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/EdgeCount.html

Subject classifications