Assertion: graph | /r/HasProperty | regular of degree n -1
Facets:
Source sentences:
text: The graph K n is regular of degree n -1, and therefore has 1/2n(n-1) edges, by consequence 3 of the handshaking lemma.