| DC 欄位 |
值 |
語言 |
| DC.contributor | 數學系 | zh_TW |
| DC.creator | 施昀延 | zh_TW |
| DC.creator | Yun-Yen Shih | en_US |
| dc.date.accessioned | 2020-7-6T07:39:07Z | |
| dc.date.available | 2020-7-6T07:39:07Z | |
| dc.date.issued | 2020 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=107221004 | |
| dc.contributor.department | 數學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 數樹的研究是組合最優化的核心問題。大量文獻致力於計算給定的圖中的某些樹結構或森林結構。在這份報告中，我們考慮下列形式的數樹問題：在一個點帶有標號的圖G 中，可找到多少棵生成樹？我們在這份報告內，對學界已發表文獻中的數樹方法、定理與其證明做了詳細的整理與回顧。本論文的貢獻在於將這些結果以更簡潔的語言與更圖例式的說明來呈現。 | zh_TW |
| dc.description.abstract | The study counting labeled trees is a central question in combinatorial optimization. A considerable amount of literature has been devoted to count certain trees or forest substructures in the ground graph. In this report, we consider the following form of counting trees questions: Given a graph G with labelled
vertices, how many spanning trees does G contain? In this article, we summarized and reviewed the existing methods and theorems in the published literature that answer this question. We try to give the proofs of the results in a more explanatory and graphic way. | en_US |
| DC.subject | 數樹 | zh_TW |
| DC.subject | 生成樹 | zh_TW |
| DC.title | 數樹：方法綜述 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | Counting Trees: A Review of Methods | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |