Assertion: graph's loop | /r/HasProperty | allowed
Facets:
Source sentences:
text: Such generalized graphs are called graphs with loops or simply graphs when it is clear from the context that loops are allowed.
text: In a graph of order n, the maximum degree of each vertex is n − 1 (or n + 1 if loops are allowed), and the maximum number of edges is n(n − 1)/2 (or
text: n(n + 1)/2 if loops are allowed).