A formula for the number of labelled trees

• 主要作者: Longani V.
• 格式: Article
• 語言: English
• 出版: 2014
• 在線閱讀: http://www.scopus.com/inward/record.url?eid=2-s2.0-54849415227&partnerID=40&md5=a1a5baaf9328c8d675e8bf0137258963; http://cmuir.cmu.ac.th/handle/6653943832/5383

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...