Assertion: graph's edge | /r/HasProperty | one per ordered pair
Facets:
value: in v. vertices
type: LOCATION
Source sentences:
text: {\displaystyle \left({\begin{array}{c}n+1\\2\end{array}}\right)} edges (one for each unordered pair), while a directed graph can have at most n 2 {\displaystyle n^{2}} edges (one per ordered pair).
text: A directed graph, or digraph G consists of a finite nonempty set of vertices V, and a finite set of edges E, where an edge is an ordered pair of vertices in V. Vertices are also commonly referred to as nodes.