A formula for the number of labelled trees
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) = fenced(frac(n, n - r)) underover(∑, i = 0, n - r - 1) (- 1)i fenced(frac(n - r, i)) (n - r - i)n - 2 . © 2008 Elsevier Ltd. All...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | 雜誌 |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=54849415227&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60269 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|