| dc.contributor.advisor | 張宜武 | zh_TW |
| dc.contributor.author (Authors) | 郭南辰 | zh_TW |
| dc.contributor.author (Authors) | Kuo, Nan-Chen | en_US |
| dc.creator (作者) | 郭南辰 | zh_TW |
| dc.creator (作者) | Kuo, Nan-Chen | en_US |
| dc.date (日期) | 2018 | en_US |
| dc.date.accessioned | 10-Aug-2018 10:39:16 (UTC+8) | - |
| dc.date.available | 10-Aug-2018 10:39:16 (UTC+8) | - |
| dc.date.issued (上傳時間) | 10-Aug-2018 10:39:16 (UTC+8) | - |
| dc.identifier (Other Identifiers) | G0101751002 | en_US |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/119293 | - |
| dc.description (描述) | 碩士 | zh_TW |
| dc.description (描述) | 國立政治大學 | zh_TW |
| dc.description (描述) | 應用數學系 | zh_TW |
| dc.description (描述) | 101751002 | zh_TW |
| dc.description.abstract (摘要) | 具有m個邊的圖G的反魔方標號，是從E(G)到1,2...m的雙射函數，使得對於所有頂點u和v其標號和彼此相異。Hartsfield and Ringel猜測每個連通圖，除了K2 以外都有一個反魔方標號，我們證明對於k-正則圖，當k≥2時是正確的。 | zh_TW |
| dc.description.abstract (摘要) | An antimagic labeling of a graph G with m edges is a bijection from E(G) to 1, 2,..., m such that for all vertices u and v, the sum of labels on edges incident to u differs from edges incident to v.Hartsfield and Ringel conjectured that every connected graph other than K2 has an antimagic labeling. We prove it is true for k-regular Graph when k≥2. | en_US |
| dc.description.tableofcontents | 第一章緒論………………………………………………………………………1第二章預備知試…………………………………………………………………3第三章 對所有k≥3的奇數的情形 ……………………………………………9第四章 對所有k≥2的整數的情形……………………………………………20參考文獻……………………………………………………………………… 25 | zh_TW |
| dc.source.uri (資料來源) | http://thesis.lib.nccu.edu.tw/record/#G0101751002 | en_US |
| dc.subject (關鍵詞) | 正則圖 | zh_TW |
| dc.title (題名) | 正則圖的反魔方標法 | zh_TW |
| dc.title (題名) | Antimagicness of regular graphs | en_US |
| dc.type (資料類型) | thesis | en_US |
| dc.relation.reference (參考文獻) | [1] N. Hartsfield and G. Ringel. Pearls in Graph Theory, Academic Press, Inc., Boston, 1990 (revised 1994), 108–109.[2] N. Alon, G. Kaplan, A. lev, Y. Roditty and R. Yuster, Dense graphs are antimagic, J Graph Theory 47 (2004), 297–309.[3] Z. B. Yilma, Antimagic Properties of Graphs with large Maximum degree, J Graph Theory 72 (2013), 367–373.[4] D. W. Cranston, Regular bipartite graphs are antimagic, J Graph Theory 60 (2009), 173–182.[5] Tom Eccles, Graphs of large linear size are antimagic, Journal of Graph Theory 81 (2016), 236-261[6] Yu‐Chang Liang, Xuding Zhu, Antimagic Labeling of Cubic Graphs, Journal of Graph Theory 75 (2014), 31-36[7] DW Cranston, YC Liang, X Zhu, Regular graphs of odd degree are antimagic, Journal of Graph Theory 80 (2015), 28-33[8] K Bérczi, A Bernáth, M Vizer, Regular Graphs are Antimagic, arXiv preprint arXiv:1504.08146, 2015 | zh_TW |
| dc.identifier.doi (DOI) | 10.6814/THE.NCCU.MATH.006.2018.B01 | - |
