| Summary: | In this paper, we define <i>D</i>-magic labelings for oriented graphs where <i>D</i> is a distance set. In particular, we label the vertices of the graph with distinct integers <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>…</mo><mo>,</mo><mo>|</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>|</mo><mo>}</mo></mrow></semantics></math></inline-formula> in such a way that the sum of all the vertex labels that are a distance in <i>D</i> 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 <i>D</i>-magic graphs, and examine trees, cycles, and multipartite graphs. This definition grew out of the definition of <i>D</i>-magic (undirected) graphs. This paper explores some of the symmetries we see between the undirected and directed version of <i>D</i>-magic labelings.
|
|---|