English  |  正體中文  |  简体中文  |  Items with full text/Total items : 70548/70548 (100%)
Visitors : 23156174      Online Users : 355
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/84266


    Title: 數樹:方法綜述;Counting Trees: A Review of Methods
    Authors: 施昀延;Shih, Yun-Yen
    Contributors: 數學系
    Keywords: 數樹;生成樹
    Date: 2020-07-06
    Issue Date: 2020-09-02 18:44:47 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 數樹的研究是組合最優化的核心問題。大量文獻致力於計算給定的圖中的某些樹結構或森林結構。在這份報告中,我們考慮下列形式的數樹問題:在一個點帶有標號的圖G 中,可找到多少棵生成樹?我們在這份報告內,對學界已發表文獻中的數樹方法、定理與其證明做了詳細的整理與回顧。本論文的貢獻在於將這些結果以更簡潔的語言與更圖例式的說明來呈現。;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.
    Appears in Collections:[數學研究所] 博碩士論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML42View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明