完整後設資料紀錄
DC 欄位語言
dc.contributor.author蔡奕正en_US
dc.contributor.authorChoi, Yi-Chengen_US
dc.contributor.author翁志文en_US
dc.contributor.authorWeng, Chih-Wenen_US
dc.date.accessioned2014-12-12T01:23:46Z-
dc.date.available2014-12-12T01:23:46Z-
dc.date.issued2009en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT079422529en_US
dc.identifier.urihttp://hdl.handle.net/11536/40826-
dc.description.abstract在本篇論文中,我們討論廣義的Petersen圖的(a,d)-反魔術標號,首先我們給出一個必要條件,並用另一種方式呈現已知的定理與猜測,特別地,我們給出P(6,2)為(12,3)-反魔術圖及P(7,3)為(20,2)-反魔術圖的實際例子並且證明出P(7,2)及P(7,3)皆不為(7,4)-反魔術圖,最後我們給出一個表格,列出n=3~8時所有P(n,k)之(a,d)-反魔術圖情形,藉以猜測更大的n的反魔術標號情形。zh_TW
dc.description.abstractIn this thesis, we discuss (a,d)-antimagic labeling of generalized Petersen graph P(n,k). First, we give a necessary condition for the existence of P(n,k), and represent some previously known theorems in our setting. Then we show that P(6,2) has (12,3)-antimagic property and P(7,3) has (20,2)-antimagic by direct construction. Moreover, we show that neither P(7,2) nor P(7,3) is (7,4)-antimagic. Finally, we give a table showing (a,d)-antimagic property for P(n,k), when n=3~8; and conjecture that the same property holds for larger n.en_US
dc.language.isozh_TWen_US
dc.subject(a,d)-反魔術標號zh_TW
dc.subject廣義的Petersen圖zh_TW
dc.subject(a,d)-Antimagic Labelingen_US
dc.subjectGeneralized Petersen Graphsen_US
dc.title廣義的Petersen圖的(a,d)-反魔術標號之探討zh_TW
dc.titleOn (a,d)-Antimagic Labeling of Generalized Petersen Graphsen_US
dc.typeThesisen_US
dc.contributor.department應用數學系所zh_TW
顯示於類別:畢業論文


文件中的檔案:

  1. 252901.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。