A New Class of Antimagic Join Graphs  

作　　者：WANG Tao LI Deming 

机构地区：[1]Department of Foundation,North China Institute of Science and Technology [2]Department of Mathematics,Capital Normal University

出　　处：《Wuhan University Journal of Natural Sciences》2014年第2期153-155,共3页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foundation of China(11371052,11271267,10971144,11101020);the Natural Science Foundation of Beijing(1102015);the Fundamental Research Funds for the Central Univer sities(2011B019,3142013104)

摘　　要：A labelingfof a graph G is a bijection from its edge set E（G） to the set {1,2,...,｜E（G）｜}, which is antimagic if for any distinct vertices x and y, the sum of the labels on edges incident to x is different from the sum of the labels on edges incident to y. A graph G is antimagic if G has anfwhich is antimagic. Hartsfield and Ringel conjectured in 1990 that every connected graph other than K2 is antimagic. In this paper, we show that if G1 is an m-vertex graph with maximum degree at most 6r＋ 1, and G2 is an n-vertex （2r）-regular graph （m≥n≥3）, then the join graph G1 v G2 is antimagic.A labelingfof a graph G is a bijection from its edge set E（G） to the set {1,2,...,｜E（G）｜}, which is antimagic if for any distinct vertices x and y, the sum of the labels on edges incident to x is different from the sum of the labels on edges incident to y. A graph G is antimagic if G has anfwhich is antimagic. Hartsfield and Ringel conjectured in 1990 that every connected graph other than K2 is antimagic. In this paper, we show that if G1 is an m-vertex graph with maximum degree at most 6r＋ 1, and G2 is an n-vertex （2r）-regular graph （m≥n≥3）, then the join graph G1 v G2 is antimagic.

关 键 词：antimagic labeling： loin raohs 

分 类 号：O157.5[理学—数学]