Antimagic labeling of regular graphs
學年 104
學期 1
出版(發表)日期 2015-08-24
作品名稱 Antimagic labeling of regular graphs
作品名稱(其他語言)
著者 Feihuang Chang; Yu-Chang Liang; Zhishi Pan; Xuding Zhu
單位
出版者
著錄名稱、卷期、頁數 Journal of Graph Theory 82(4), pp.339-349
摘要 A graph G = (V, E ) is antimagic if there is a one-to-one correspondence f : E → {1, 2,..., |E|} such that for any two vertices u, v, Σe∈ E(u) f(e)≠Σe∈E(v ) f(e). It is known that bipartite regular graphs are antimagic and nonbipartite regular graphs of odd degree at least three are antimagic. Whether all nonbipartite regular graphs of even degree are antimagic remained an open problem. In this article, we solve this problem and prove that all even degree regular graphs are antimagic.
關鍵字 antimagic;regular graph;labeling
語言 en_US
ISSN 0364-9024 1097-0118
期刊性質 國外
收錄於 SCI
產學合作
通訊作者
審稿制度
國別 USA
公開徵稿
出版型式 ,電子版,紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/106203 )