Assertion: graph's number | /r/HasProperty | − 1)/2
Facets:
Source sentences:
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