Orientable $\mathbb{Z}{}_{n}$-distance magic regular graphs

TL;DR

This paper investigates orientable bn-distance magic labelings in regular graphs, providing infinite families of such graphs and examples of non-orientable cases, focusing on lexicographic products.

Contribution

It introduces infinite families of odd regular graphs with orientable bn-distance magic labelings and identifies non-orientable cases, advancing understanding of graph labelings.

Findings

Infinite family of odd regular graphs with orientable bn-distance magic labelings.

Existence of odd regular graphs that are not orientable bn-distance magic.

Results based on lexicographic product of graphs.

Abstract

Hefetz, M\"{u}tze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation. In this paper we support the analogous question for distance magic labeling. Let $\Gamma$ be an Abelian group of order $n$. A \textit{directed $\Gamma$-distance magic labeling} of an oriented graph $\vec{G} = (V,A)$ of order $n$ is a bijection $\vec{l}:V \rightarrow \Gamma$ with the property that there is a \textit{magic constant} $\mu \in \Gamma$ such that for every $x \in V(G)$ $ w(x) = \sum_{y \in N^{+}(x)}\vec{l}(y) - \sum_{y \in N^{-}(x)} \vec{l}(y) = \mu. $ In this paper we provide an infinite family of odd regular graphs possessing an orientable $\mathbb{Z}_{n}$-distance magic labeling. Our results refer to lexicographic product of graphs. We also present a family of odd regular graphs that are not orientable $\mathbb{Z}_{n}$-distance magic.