Zero-sum magic and null sets of planar graphs

被引:0
|
作者
Salehi, Ebrahim [1 ]
Hansen, Samuel [1 ]
机构
[1] Department of Mathematical Sciences, University of Nevada, Las Vegas, Las Vegas, NV 89154-4020, United States
关键词
Graphic methods;
D O I
暂无
中图分类号
O144 [集合论]; O157 [组合数学(组合学)];
学科分类号
070104 ;
摘要
For any h ∈ N, a graph G =(V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh - {0} such that the induced vertex labeling l+: V(G)→ Zh defined by l+(v) = Σ uv∈E(G) l(uv) is a constant map. When this constant is 0 we call G a zero-sum h-magic graph. The null set of G is the set of all natural numbers h ∈ N for which G admits a zero-sum h-magic labeling. A graph G is said to be uniformly null if every magic labeling of G induces zero sum. In this paper we will identify the null sets of certain planar graphs such as wheels and fans.
引用
收藏
页码:55 / 64
相关论文
共 50 条
  • [21] Zero-sum subsets of decomposable sets in Abelian groups
    Banakh, T.
    Raysky, A.
    ALGEBRA AND DISCRETE MATHEMATICS, 2020, 30 (01): : 15 - 25
  • [22] Monochromatic and zero-sum sets of nondecreasing modified diameter
    Grynkiewicz, D
    Sabar, R
    ELECTRONIC JOURNAL OF COMBINATORICS, 2006, 13 (01):
  • [23] On the existence of zero-sum perfect matchings of complete graphs
    Kittipassorn, Teeradej
    Sinsap, Panon
    ARS MATHEMATICA CONTEMPORANEA, 2023, 23 (03)
  • [24] Perfect Matching and Zero-Sum 3-Magic Labeling
    Li Y.
    Wang H.
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2023, 117 : 209 - 216
  • [25] Partition of Abelian groups into zero-sum sets by complete mappings and its application to the existence of a magic rectangle set
    Cichacz, Sylwia
    JOURNAL OF ALGEBRAIC COMBINATORICS, 2025, 61 (02)
  • [26] An addition theorem and maximal zero-sum free sets in ℤ/pℤ
    Éric Balandraud
    Israel Journal of Mathematics, 2012, 188 : 405 - 429
  • [27] Zero-sum delta-systems and multiple copies of graphs
    Caro, Y
    Provstgaard, C
    JOURNAL OF GRAPH THEORY, 1999, 32 (02) : 207 - 216
  • [28] On degree-d zero-sum sets of full rank
    Christof Beierle
    Alex Biryukov
    Aleksei Udovenko
    Cryptography and Communications, 2020, 12 : 685 - 710
  • [29] A note on zero-sum 5-flows in regular graphs
    Akbari, S.
    Ghareghani, N.
    Khosrovshahi, G. B.
    Zare, S.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (02):
  • [30] Circular Zero-Sum r-Flows of Regular Graphs
    Saieed Akbari
    Amir Hossein Ghodrati
    Mohammad Ali Nematollahi
    Graphs and Combinatorics, 2020, 36 : 1079 - 1092