Assertion: graph's degree | /r/HasProperty | − 1
Facets:
value: in a graph of order n
type: OTHER
Source sentences:
text: In an undirected simple graph of order n, the maximum degree of each vertex is n − 1 and the maximum size of the graph is n(n − 1)/2.
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