CONSTANT SUM PARTITION OF SETS OF INTEGERS AND DISTANCE MAGIC GRAPHS

被引:5
|
作者
Cichacz, Sylwia [1 ]
Gorlich, Agnieszka [1 ]
机构
[1] AGH Univ Sci & Technol, Fac Appl Math, Krakow, Poland
关键词
constant sum partition; distance magic labeling; product of graphs; ASCENDING SUBGRAPH DECOMPOSITIONS; SUBSETS; PRODUCTS;
D O I
10.7151/dmgt.1991
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let A = {1, 2,..., t(m)+t(n)}. We shall say that A has the (m, n, t) -balanced constant-sum-partition property ((m, n, t)-BCSP-property) if there exists a partition of A into 2t pairwise disjoint subsets A(1), A(2), ..., A(t), B-1, B-2, ..., B-t such that vertical bar A(i)vertical bar = m and vertical bar B-i vertical bar = n, and Sigma(a is an element of Ai) a = Sigma(b is an element of Bj), b for 1 <= i <= t and 1 <= j <= t. In this paper we give sufficient and necessary conditions for a set A to have the (m, n, t)-BCSP-property in the case when m and n are both even. We use this result to show some families of distance magic graphs.
引用
收藏
页码:97 / 106
页数:10
相关论文
共 50 条