Abstract
In this paper, we define D-magic labelings for oriented graphs where D is a distance set. In particular, we label the vertices of the graph with distinct integers {1,2,…,|V(G)|} in such a way that the sum of all the vertex labels that are a distance in D away from a given vertex is the same across all vertices. We give some results related to the magic constant, construct a few infinite families of D-magic graphs, and examine trees, cycles, and multipartite graphs. This definition grew out of the definition of D-magic (undirected) graphs. This paper explores some of the symmetries we see between the undirected and directed version of D-magic labelings.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference18 articles.
1. A Dynamic Survey of Graph Labeling;Gallian;Electron. J. Comb.,2020
2. On Graceful Directed Graphs
3. Magic digraphs;Bloom;J. Comb. Math. Comb. Comput.,2008
4. Vertex in-magic arc labelings of digraphs
5. V-super vertex out-magic total labelings of digraphs;Guruvaiah;Commun. Korean Math. Soc.,2017
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献