Abstract
Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let Γ be an Abelian group of order n. A directedΓ-distance magic labeling of an oriented graph G→=(V,A) of order n is a bijection l→:V→Γ with the property that there is a magic constantμ∈Γ such that for every x∈V(G)w(x)=∑y∈N+(x)l→(y)−∑y∈N−(x)l→(y)=μ. In this paper we provide an infinite family of odd regular graphs possessing an orientable Zn-distance magic labeling. Our results refer to lexicographic product of graphs. We also present a family of odd regular graphs that are not orientable Zn-distance magic.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
