Distance magic graphs G x Cn

被引:11
作者
Cichacz, Sylwia [1 ]
机构
[1] AGH Univ Sci & Technol, Fac Appl Math, PL-30059 Krakow, Poland
关键词
Distance magic labeling; Magic constant; Sigma labeling; Graph labeling; Abelian group; Direct product; Kronecker product;
D O I
10.1016/j.dam.2014.05.044
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A Gamma-distance magic labeling of a graph G = (V, E) with vertical bar V vertical bar = n is a bijection f from V to an Abelian group Gamma of order n such that the weight w(x) = Sigma(y is an element of NG(x)) f(y) of every vertex x is an element of V is equal to the same element mu is an element of Gamma, called the magic constant. In this paper we will show that if G is a graph of order n = 2(p)(2k + 1) for some natural numbers p, k such that deg(v) equivalent to c (mod 2(p+2)) for some constant c for any v is an element of V(G), then there exists a Gamma-distance magic labeling for any Abelian group Gamma of order 4n for the direct product G X C-4. Moreover if c is even, then there exists a Gamma-distance magic labeling for any Abelian group P of order 8n for the direct product G X C-8. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:80 / 87
页数:8
相关论文
共 22 条
[11]  
Hammack R., 2011, Hand Book of Product Graphs
[12]  
Harary F., 1994, Graph Theory, P22
[13]  
Hedetniemi S.T., 1966, 310544T U MICH
[14]  
Imrich W, 2000, WIL INT S D
[15]  
Jha P.K., 1994, PREPRINT SER U LIUBL, V32
[16]  
Jinnah M.I., 1999, TECHN P GROUP DISC G, P71
[17]  
Lamprey R. H., 1974, Modeling and Simulation vol.5, P1119
[18]  
Miller M., 2003, AUSTRALAS J COMBIN, V28, P305
[19]  
Rao S.B., 2004, Graphs, Combinatorics, Algorithms and Applications, P125
[20]  
Rao S.B., 2008, Labelings of Discrete Structures and Applications, P135