| DC 欄位 |
值 |
語言 |
| DC.contributor | 數學系 | zh_TW |
| DC.creator | 張凱涵 | zh_TW |
| DC.creator | Kai-han Chang | en_US |
| dc.date.accessioned | 2007-7-17T07:39:07Z | |
| dc.date.available | 2007-7-17T07:39:07Z | |
| dc.date.issued | 2007 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=942201005 | |
| dc.contributor.department | 數學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 一個圖G可以被分解成t個同構的子圖，我們稱G是可t分解的。
具有多重邊的路(path)稱為multipath。
一個樹(tree)只有唯一一個點(vertex) degree $geq$ 3，稱為蜘蛛(spider).
在這篇論文中，
我們探討了可二分解和三分解的multipaths與可t分解的蜘蛛。 | zh_TW |
| dc.description.abstract | 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. | en_US |
| DC.subject | 圖形分解 | zh_TW |
| DC.subject | 多重邊路圖 | zh_TW |
| DC.subject | 蜘蛛圖 | zh_TW |
| DC.subject | multipaths | en_US |
| DC.subject | decomposition | en_US |
| DC.subject | spiders | en_US |
| DC.title | 2-decomposable, 3-decomposable multipaths and t-decomposable spiders | en_US |
| dc.language.iso | en_US | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |