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 条
[1]  
Anholcer M., 2015, ARS MATH CONT, V9, P93
[2]  
[Anonymous], GRAPHS COMB IN PRESS
[3]  
[Anonymous], PREPRINT
[4]  
Arumugam S, 2011, J INDONES MATH SOC, P11
[5]   On Σ and Σ′ labelled graphs [J].
Beena, S. .
DISCRETE MATHEMATICS, 2009, 309 (06) :1783-1787
[6]  
Cichacz S., 2013, DISTANCE MAGIC CIRCU
[7]   Note on Group Distance Magic Graphs G[C 4] [J].
Cichacz, Sylwia .
GRAPHS AND COMBINATORICS, 2014, 30 (03) :565-571
[8]  
Froncek D., 2006, Bull. Inst. Combin. Appl., V48, P31
[9]  
Froncek D, 2013, AUSTRALAS J COMB, V55, P167
[10]  
Gallian J.A., 2013, ELECT J COMBIN DS, VDS6