| DC 欄位 |
值 |
語言 |
| DC.contributor | 數學系 | zh_TW |
| DC.creator | 許豐如 | zh_TW |
| DC.creator | Feng-Ru Hsu | en_US |
| dc.date.accessioned | 2006-6-23T07:39:07Z | |
| dc.date.available | 2006-6-23T07:39:07Z | |
| dc.date.issued | 2006 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=93221022 | |
| dc.contributor.department | 數學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 由於實際資源分享的問題，我們在此篇論文裡面考量到控制問題的變形，稱為距離二以內的控制問題。
這篇論文的架構如下。第一節、介紹基本的定義。第二節、研究paths 和cycles之距離二以內的控制。第三節、證明D_{3,2,1}控制問題為NP-complete在二分圖上。第四節、決定fully binary tree 之D_{3,2,1}控制數。 | zh_TW |
| dc.description.abstract | Due to a practical resource sharing problem, we consider a variation of the domination problem in this thesis which we call the distance-two domination problem.
This thesis is organized as follows. Section 1 gives basic definitions and notation. Section 2 investigates the distance-two domination of paths and cycles. Section 3 shows that D_{3,2,1}-domination problem is NP-complete for bipartite graphs. And we determine the D_{3,2,1}-domination number of fully binary tree in the final section. | en_US |
| DC.subject | NP complete | en_US |
| DC.subject | domination | en_US |
| DC.title | Distance-two domination of graphs | 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 |