# zbMATH — the first resource for mathematics

Orientable $$\mathbb{Z}_N$$-distance magic graphs. (English) Zbl 1404.05185
Summary: Let $$G = (V, E)$$ be a graph of order $$n$$. A distance magic labeling of $$G$$ is a bijection $$\ell: V\rightarrow\{1, 2, \dots, n\}$$ for which there exists a positive integer $$k$$ such that $$\sum_{x\in N(v)}\ell(x) = k$$ for all $$v\in V$$, where $$N(v)$$ is the open neighborhood of $$v$$.
Tuttes flow conjectures are a major source of inspiration in graph theory. In this paper we ask when we can assign $$n$$ distinct labels from the set $$\{1, 2, \dots, n\}$$ to the vertices of a graph $$G$$ of order $$n$$ such that the sum of the labels on heads minus the sum of the labels on tails is constant modulo $$n$$ for each vertex of $$G$$. Therefore we generalize the notion of distance magic labeling for oriented graphs.
##### MSC:
 05C78 Graph labelling (graceful graphs, bandwidth, etc.) 05C15 Coloring of graphs and hypergraphs 05C22 Signed and weighted graphs 05C20 Directed graphs (digraphs), tournaments 05C25 Graphs and abstract algebra (groups, rings, fields, etc.) 05C76 Graph operations (line graphs, products, etc.)
##### Keywords:
distance magic graph; digraph; flow graph
Full Text:
##### References:
 [1] S. Arumugam, D. Froncek and N. Kamatchi, Distance Magic Graphs—A Survey, J. Indones. Math. Soc., Special Edition (2011) 11-26. doi:10.22342/jims.0.0.15.11-26 · Zbl 1288.05216 [2] G.S. Bloom and D.F. Hsu, On graceful digraphs and a problem in network addressing, Congr. Numer. 35 (1982) 91-103. · Zbl 0543.05031 [3] G.S. Bloom, A. Marr and W.D. Wallis, Magic digraphs, J. Combin. Math. Combin. Comput. 65 (2008) 205-212. · Zbl 1147.05036 [4] S. Cichacz, Note on group distance magic graphs G[C_4], Graphs Combin. 30 (2014) 565-571. doi:10.1007/s00373-013-1294-z · Zbl 1294.05135 [5] S. Cichacz, Distance magic graphs G × Cn, Discrete Appl. Math. 177 (2014) 80-87. doi:10.1016/j.dam.2014.05.044 · Zbl 1297.05201 [6] S. Cichacz and D. Froncek, Distance magic circulant graphs, Discrete Math. 339 (2016) 84-94. doi:10.1016/j.disc.2015.07.002 · Zbl 1322.05120 [7] B. Freyberg and M. Keranen, Orientable ℤ_n-distance magic graphs via products, Australas. J. Combin. 70 (2018) 319-328. · Zbl 1383.05279 [8] B. Freyberg and M. Keranen, Orientable ℤ_n-distance magic labeling of the Cartesian product of two cycles, Australas. J. Combin. 69 (2017) 222-235. · Zbl 1375.05233 [9] D. Froncek, Group distance magic labeling of of Cartesian product of cycles, Australas. J. Combin. 55 (2013) 167-174. · Zbl 1278.05210 [10] J.A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. #DS6. · Zbl 0953.05067 [11] N. Hartsfield and G. Ringel, Pearls in Graph Theory, (Academic Press, Boston 1990, Revised version 1994) 108-109. · Zbl 0703.05001 [12] R. Hammack, W. Imrich and S. Klavžar, Handbook of Product Graphs, Second Edition (CRC Press, Boca Raton, FL, 2011). · Zbl 1283.05001 [13] M.I. Jinnah, On Σ-labelled graphs, in: Technical Proceedings of Group Discussion on Graph Labeling Problems, B.D. Acharya and S.M. Hedge (Ed(s)) (1999) 71-77. [14] G. Kaplan, A. Lev and Y. Roditty, On zero-sum partitions and anti-magic trees, Discrete Math. 309 (2009) 2010-2014. doi:10.1016/j.disc.2008.04.012 · Zbl 1229.05031 [15] M. Miller, C. Rodger and R. Simanjuntak, Distance magic labelings of graphs, Australas. J. Combin. 28 (2003) 305-315. · Zbl 1031.05117 [16] S.B. Rao, Sigma graphs—a survey, in: Labelings of Discrete Structures and Applications, B.D. Acharya, S. Arumugam and A. Rosa (Ed(s)), (Narosa Publishing House, New Delhi, 2008) 135-140. · Zbl 1180.05107 [17] V. Vilfred, Σ-Labelled Graphs and Circulant Graphs, Ph.D. Thesis (University of Kerala, Trivandrum, India, 1994).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.