|
Show that the number of labeled trees with n vertices, k of which are pendant vertices, is (n - k)!S(n - 2, n - k) = (n!/k!)S(n - 2, n - k), where S(n - 2, n - k) is a Stirling number of the second kind. (This result was first established in 1959 by A. Renyi.) |
| New search. (Also 1294 free access solutions) |