Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/32613
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 張宜武 | zh_TW |
dc.contributor.author | 郭威廷 | zh_TW |
dc.contributor.author | Kuo, Wei-Ting | en_US |
dc.creator | 郭威廷 | zh_TW |
dc.creator | Kuo, Wei-Ting | en_US |
dc.date | 2005 | en_US |
dc.date.accessioned | 2009-09-17T05:50:58Z | - |
dc.date.available | 2009-09-17T05:50:58Z | - |
dc.date.issued | 2009-09-17T05:50:58Z | - |
dc.identifier | G0927510171 | en_US |
dc.identifier.uri | https://nccur.lib.nccu.edu.tw/handle/140.119/32613 | - |
dc.description | 碩士 | zh_TW |
dc.description | 國立政治大學 | zh_TW |
dc.description | 應用數學研究所 | zh_TW |
dc.description | 92751017 | zh_TW |
dc.description | 94 | zh_TW |
dc.description.abstract | A mixed hypergraph is a triple H = (X; C;D), where X is the vertex set, and each of C;D is a list of subsets of X. A strict t-coloring is a onto mapping from X to {1, 2,…,t} such that each c belongs to C contains two vertices have a common value and each d belongs to D has two vertices have distinct values. If H has a strict t-coloring, then t belongs to S(H), such S(H) is called the feasible set of H, and k is a gap if there are a value larger than k and a value less than k in the feasible set but k is not.\nWe find the minimum and maximum gap of a mixed hypergraph with more than 5 vertices. Then we consider two special cases of the gap of mixed hypergraphs. First, if the mixed hypergraphs is spanned by a complete bipartite graph, then the gap is decided by the size of bipartition. Second, the (l,m)-uniform mixed hypergraphs has gaps if l > m/2 >2, and we prove that the minimum number of vertices of a (l,m)-uniform mixed hypergraph which has gaps is (m/2)( l -1) + m. | en_US |
dc.description.tableofcontents | Abstract i\n1 Introduction 1\n2 Maximum gaps of mixed hypergraphs with n vertices 3\n3 Mixed hypergraphs spanned by complete bipartite graphs 8\n4 Gaps of (l,m)-uniform mixed hypergraphs 11\nReferences 15 | zh_TW |
dc.format.extent | 44963 bytes | - |
dc.format.extent | 54623 bytes | - |
dc.format.extent | 73827 bytes | - |
dc.format.extent | 43069 bytes | - |
dc.format.extent | 81686 bytes | - |
dc.format.extent | 92910 bytes | - |
dc.format.extent | 91858 bytes | - |
dc.format.extent | 107690 bytes | - |
dc.format.extent | 46024 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.format.mimetype | application/pdf | - |
dc.language.iso | en_US | - |
dc.source.uri | http://thesis.lib.nccu.edu.tw/record/#G0927510171 | en_US |
dc.subject | mixed hypergraph | en_US |
dc.subject | feasible set | en_US |
dc.subject | gap | en_US |
dc.title | Maximum Gap of Mixed Hypergraph | en_US |
dc.type | thesis | en |
dc.relation.reference | [1] E. Bulgaru and V. Voloshin, Mixed interval hypergraphs, Discrete Applied Math. 77 | zh_TW |
dc.relation.reference | (1997), 29–41. | zh_TW |
dc.relation.reference | [2] T. Jiang, D. Mubayi, Z. Tuza, V. Voloshin, and D. West, The chromatic spectrum of | zh_TW |
dc.relation.reference | mixed hypergraphs, Graphs Combin. 18 (2003), 309–318. | zh_TW |
dc.relation.reference | [3] D. Kr´al’, J. Kratochv´il, and H. Voss, Mixed hypercacti, Discrete Math. 286 (2004), | zh_TW |
dc.relation.reference | 99–113. | zh_TW |
dc.relation.reference | [4] M. Gionfriddo, L. Milazzo, and V. Voloshin, On the upper chromatic index of a | zh_TW |
dc.relation.reference | multigraph, Computer Science J. Moldova 10 (2002), 81–91. | zh_TW |
dc.relation.reference | [5] V. Voloshin, On the upper chromatic number of a hypergraph, Australasian J. Comb. | zh_TW |
dc.relation.reference | 11 (1995), 25–45. | zh_TW |
item.languageiso639-1 | en_US | - |
item.cerifentitytype | Publications | - |
item.fulltext | With Fulltext | - |
item.openairetype | thesis | - |
item.openairecristype | http://purl.org/coar/resource_type/c_46ec | - |
item.grantfulltext | open | - |
Appears in Collections: | 學位論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
51017101.pdf | 43.91 kB | Adobe PDF2 | View/Open | |
51017102.pdf | 53.34 kB | Adobe PDF2 | View/Open | |
51017103.pdf | 72.1 kB | Adobe PDF2 | View/Open | |
51017104.pdf | 42.06 kB | Adobe PDF2 | View/Open | |
51017105.pdf | 79.77 kB | Adobe PDF2 | View/Open | |
51017106.pdf | 90.73 kB | Adobe PDF2 | View/Open | |
51017107.pdf | 89.71 kB | Adobe PDF2 | View/Open | |
51017108.pdf | 105.17 kB | Adobe PDF2 | View/Open | |
51017109.pdf | 44.95 kB | Adobe PDF2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.