| DC 欄位 |
值 |
語言 |
| DC.contributor | 數學系 | zh_TW |
| DC.creator | 龔欣如 | zh_TW |
| DC.creator | Hsin-Ju Gong | en_US |
| dc.date.accessioned | 2004-7-6T07:39:07Z | |
| dc.date.available | 2004-7-6T07:39:07Z | |
| dc.date.issued | 2004 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=91221016 | |
| dc.contributor.department | 數學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | In this thesis, we study the signed domination problem from an algorithmic point of view. In particular, we present some linear algorithms for finding the signed domination numbers of some special block graphs, such as block path and good block graph that every block of G has at least one vertex which is not a cut-vertex of G. | en_US |
| DC.subject | Signed Domination | zh_TW |
| DC.subject | block graph | zh_TW |
| DC.subject | signed domination | en_US |
| DC.subject | block graph | en_US |
| DC.title | Signed Domination in Block Graphs | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | Signed Domination in Block Graphs | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |