欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
A labeling/of 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 anAy,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 an f which 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+l,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.
同期刊论文项目
同项目期刊论文
期刊信息
位置：