English  |  正體中文  |  简体中文  |  Items with full text/Total items : 75369/75369 (100%)
Visitors : 25463618      Online Users : 181
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/7908

    Title: 2-decomposable, 3-decomposable multipaths and t-decomposable spiders
    Authors: 張凱涵;Kai-han Chang
    Contributors: 數學研究所
    Keywords: 圖形分解;多重邊路圖;蜘蛛圖;multipaths;decomposition;spiders
    Date: 2007-06-28
    Issue Date: 2009-09-22 11:08:46 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 一個圖G可以被分解成t個同構的子圖,我們稱G是可t分解的。 具有多重邊的路(path)稱為multipath。 一個樹(tree)只有唯一一個點(vertex) degree $geq$ 3,稱為蜘蛛(spider). 在這篇論文中, 我們探討了可二分解和三分解的multipaths與可t分解的蜘蛛。 A graph G is t-decomposable if and only if G can be decomposed into t isomorphic subgraphs. A multipath is a path with multiple edges allowed. A spider is a tree which has a unique vertex with degree ≥ 3. In this thesis, we investigate 2-decomposable and 3-decomposable multipaths and t-decomposable spiders.
    Appears in Collections:[數學研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    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 ©   - 隱私權政策聲明