Introduction to graph theory
Graphs and Digraphs, Fourth Edition
Graphs and Digraphs, Fourth Edition
Applied Combinatorics
Hi-index | 0.09 |
Let L(n,r) be the number of labelled trees with n points and r end-points. In this paper it is shown that the number L(n,r) can be obtained from the formula L(n,r)=nn-r@?i=0n-r-1(-1)^in-ri(n-r-i)^n^-^2.