Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/60269
Title: A formula for the number of labelled trees
Authors: Vites Longani
Authors: Vites Longani
Keywords: Computer Science;Mathematics
Issue Date: 1-Dec-2008
Abstract: 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 rights reserved.
URI: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=54849415227&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/60269
ISSN: 08981221
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.