Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/60269Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Vites Longani | en_US |
| dc.date.accessioned | 2018-09-10T03:40:27Z | - |
| dc.date.available | 2018-09-10T03:40:27Z | - |
| dc.date.issued | 2008-12-01 | en_US |
| dc.identifier.issn | 08981221 | en_US |
| dc.identifier.other | 2-s2.0-54849415227 | en_US |
| dc.identifier.other | 10.1016/j.camwa.2008.07.011 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=54849415227&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/60269 | - |
| dc.description.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. | en_US |
| dc.subject | Computer Science | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | A formula for the number of labelled trees | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | Computers and Mathematics with Applications | en_US |
| article.volume | 56 | en_US |
| article.stream.affiliations | Chiang Mai University | en_US |
| 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.