| DC 欄位 |
值 |
語言 |
| DC.contributor | 數學系 | zh_TW |
| DC.creator | 黃衍勝 | zh_TW |
| DC.creator | Yan-sheng Huang | en_US |
| dc.date.accessioned | 2015-1-14T07:39:07Z | |
| dc.date.available | 2015-1-14T07:39:07Z | |
| dc.date.issued | 2015 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=101221017 | |
| dc.contributor.department | 數學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 反魔術圖是圖形的一種標號,當我們找到一種標號方式使得圖形的所有點之和都不相同時,我們稱這種圖形是反魔術圖。
在這篇論文中,第一章我們討論反魔術圖的一些基本定義,第二章證明路徑(path)與星林(star forest)的聯集,在每一分量(component)的邊數都大於等於3的情況下是反魔術圖,第三章討論更廣義的反魔術性質,也證明了環路(cycle),完全圖(complete),輪子(wheel),風箏(kite)都是廣義的反魔術圖。
| zh_TW |
| dc.description.abstract | A graph G is called an antimagic graph if exists an edge labeling with labels 1,2,⋯,|E(G)| such that all vertex sums are distinct.
In this paper, Section 1 is the introduction of antimagic graph. In Section 2, we prove that the union of a path and some stars is antimagic. Section 3 is the introduction of antimagic with a generalization, and we prove that cycles, complete graphs, wheels and kites are R-antimagic.
| en_US |
| DC.subject | 圖論 | zh_TW |
| DC.subject | 反魔術 | zh_TW |
| DC.title | The antimagic graph with a generalization | en_US |
| dc.language.iso | en_US | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |