Assertion: graph's number | /r/HasProperty | − 1
Facets:
Source sentences:
text: This minimal number of leaves is characteristic of path graphs; the maximal number, n − 1 , is attained only by star graphs.
text: The number of different Hamiltonian cycles in a complete undirected graph on n vertices is (n − 1)!