| dc.contributor.advisor | 張宜武 | zh_TW |
| dc.contributor.author (作者) | 游喬任 | zh_TW |
| dc.creator (作者) | 游喬任 | zh_TW |
| dc.date (日期) | 2006 | en_US |
| dc.date.accessioned | 17-九月-2009 13:47:55 (UTC+8) | - |
| dc.date.available | 17-九月-2009 13:47:55 (UTC+8) | - |
| dc.date.issued (上傳時間) | 17-九月-2009 13:47:55 (UTC+8) | - |
| dc.identifier (其他 識別碼) | G0094751003 | en_US |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/32585 | - |
| dc.description (描述) | 碩士 | zh_TW |
| dc.description (描述) | 國立政治大學 | zh_TW |
| dc.description (描述) | 應用數學研究所 | zh_TW |
| dc.description (描述) | 94751003 | zh_TW |
| dc.description (描述) | 95 | zh_TW |
| dc.description.abstract (摘要) | 在本篇論文，我們去找一個唯一著色的均勻混合超級圖的點數及邊數的下界。我們證明為一著色的均勻混合超級圖的點數必須超過(l-1)(m-1)+1而且我們提出一個方法來建構為一著色的均勻混合超級圖。如果一個混合超圖是個D為空集合的r-均勻超級圖，當r=2則它是唯一著色的。否則，D為空集合的均勻超級圖不會是唯一著色的。我們介紹兩種有系統的方法建構唯一著色的均勻混合超級圖並且達到我們的邊界。首先，我們是著保持均勻混合超級圖的唯一著色下去減少D邊的個數。然後我們減少D邊的個數。我們考慮r均勻的C超圖和D超圖並找他們邊的個數的範圍。 | zh_TW |
| dc.description.abstract (摘要) | In this thesis, we find the lower bounds of number of vertices and edges ofuniform mixed hypergraph which is uniquely colorable. We show that the size of vertex set of uniform mixed hypergraphs with unique coloring is more than (l-1)(m-1)+1 and we come up a way to construct uniquely colorable uniform mixed hypergraphs. If a mixed hypergraph is an r-uniform hypergraph with D empty, then it is uniquely colorable when r=2. Otherwise, an r-uniform hypergraph with D empty is not uniquely colorable. We will introduce two systematic ways to construct a uniform mixed hypergraph which is uniquely colorable and achieves our bounds. First,we reduce the number of C-edges such that uniform mixed hypergraphs keep being uniquely colorable. Then we reduce the number of D-edges. We consider r-uniform C-hypergraphs and D-hypergraphs and find the bounds on their number of edges. | en_US |
| dc.description.tableofcontents | Abstrat...........................................i中文摘要...........................................ii1 Introduction....................................12 The Vertex Set of Uniquely Colorable (l,m)-Uniform Mixed Hypergraphs.................23 The Uniquely Colorable r-Uniform Hypergraphs....44 Constructions of Uniquely Colorable Uniform Mixed Hypergraphs.......................7Reference.........................................24 | zh_TW |
| dc.format.extent | 62277 bytes | - |
| dc.format.extent | 18516 bytes | - |
| dc.format.extent | 59986 bytes | - |
| dc.format.extent | 34670 bytes | - |
| dc.format.extent | 52581 bytes | - |
| dc.format.extent | 52078 bytes | - |
| dc.format.extent | 144632 bytes | - |
| dc.format.extent | 20787 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.format.mimetype | application/pdf | - |
| dc.format.mimetype | application/pdf | - |
| dc.format.mimetype | application/pdf | - |
| dc.format.mimetype | application/pdf | - |
| dc.format.mimetype | application/pdf | - |
| dc.format.mimetype | application/pdf | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.source.uri (資料來源) | http://thesis.lib.nccu.edu.tw/record/#G0094751003 | en_US |
| dc.subject (關鍵詞) | 均勻混合超級圖 | zh_TW |
| dc.subject (關鍵詞) | 唯一著色 | zh_TW |
| dc.subject (關鍵詞) | uinform mixed hypergraph | en_US |
| dc.subject (關鍵詞) | uniquely colorable | en_US |
| dc.title (題名) | 均勻混合超級圖的唯一著色 | zh_TW |
| dc.title (題名) | The Unique colorability of a Uniform Mixed Hypergraph | en_US |
| dc.type (資料類型) | thesis | en |
| dc.relation.reference (參考文獻) | 1. V.I. Voloshin. The mixed hypergraphs. Comput. Sci. J. | zh_TW |
| dc.relation.reference (參考文獻) | Moldova 1 (1993), 45-52. | zh_TW |
| dc.relation.reference (參考文獻) | 2. Zs. Tuza, V.I. Voloshin, H. Zhou. Uniquely colorable mixed hypergraphs. Discrete Math., to appear. | zh_TW |
| dc.relation.reference (參考文獻) | 3. Zs. Tuza, V.I. Voloshin. Uncolorable mixed hypergraphs. | zh_TW |
| dc.relation.reference (參考文獻) | Discrete Appl. Math. 99 (2000), 209-227. | zh_TW |
