Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/56876
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 張宜武 | zh_TW |
dc.contributor.author | 潘丞偉 | zh_TW |
dc.creator | 潘丞偉 | zh_TW |
dc.date | 2012 | en_US |
dc.date.accessioned | 2013-02-01T08:53:14Z | - |
dc.date.available | 2013-02-01T08:53:14Z | - |
dc.date.issued | 2013-02-01T08:53:14Z | - |
dc.identifier | G0098751008 | en_US |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/56876 | - |
dc.description | 碩士 | zh_TW |
dc.description | 國立政治大學 | zh_TW |
dc.description | 應用數學研究所 | zh_TW |
dc.description | 98751008 | zh_TW |
dc.description | 101 | zh_TW |
dc.description.abstract | 在這篇論文中,我們探討對立圖形的特性,並藉由度數大於等於三的點,判斷一樹是否為對立圖形,最後證明Pn, Cn n ≥ 3 且 n = 4k; k ∈ N 家族的圖是對立圖形且Tn, Cn n ≥ 3 且n ̸= 4k; k ∈ N 家族的圖是對立圖形。 | zh_TW |
dc.description.abstract | In this thesis, we use the number of vertices with degree greater than or equal to 3 as a criterion for trees being opposition graphs. Finally, we prove some families of graphs such as Pn, Cn with n ≥ 3 and n = 4k; k ∈ N are opposition graphs and some families of graphs such as Tn,\nCn with n ≥ 3 and n ̸= 4k; k ∈ N are not opposition graphs. | en_US |
dc.description.tableofcontents | Contents\nAbstract ii\n中文摘要iii\n1 Introduction 1\n2 Definitions 3\n3 Some Opposition Graphs 7\n3.1 R(T) = ∅ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8\n3.2 There Are Only One Vertex u in R . . . . . . . . . . . . . . . . . . 11\n3.3 There Are Two Vertices u,v in R(T) . . . . . . . . . . . . . . . . . 16\n3.4 There Are More Than Two Vertices in R . . . . . . . . . . . . . . . 22\n4 Some Families of Opposition Graphs 24\n5 Open Problems and Further Directions of Studies 28\nReferences 29\ni | zh_TW |
dc.language.iso | en_US | - |
dc.source.uri | http://thesis.lib.nccu.edu.tw/record/#G0098751008 | en_US |
dc.subject | 對立圖形 | zh_TW |
dc.subject | Opposition Graphs | en_US |
dc.title | 有關對立圖形的探討 | zh_TW |
dc.title | Some Problems on Opposition Graphs | en_US |
dc.type | thesis | en |
dc.relation.reference | References\n[1] A. N. Trenk, Tolerance Graphs, Cambridge Univ Pr, 2004.\n[2] A. Tucker, Applied Combinatorics, Wiley, 2006.\n[3] D. B. West, Introduction to Graph Theory, Prentice Hall, 2001. | zh_TW |
item.fulltext | With Fulltext | - |
item.openairetype | thesis | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_46ec | - |
item.grantfulltext | restricted | - |
item.languageiso639-1 | en_US | - |
Appears in Collections: | 學位論文 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
100801.pdf | 1.48 MB | Adobe PDF2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.