TY - JOUR

T1 - Orientable Group Distance Magic Labeling of Directed Graphs

AU - Ashraf, Wasim

AU - Shaker, Hani

AU - Imran, Muhammad

N1 - Publisher Copyright:
© 2022 Wasim Ashraf et al.

PY - 2022

Y1 - 2022

N2 - A directed graph G is said to have the orientable group distance magic labeling if there exists an abelian group and one-one map ℓ from the vertex set of G to the group elements, such that y NG+xy-y NG-xy=μ for all x V, where NGx is the open neighborhood of x, and μ is the magic constant; more specifically, such graph is called orientable -distance magic graph. In this study, we prove directed antiprism graphs are orientable 2n, 2×n, and 3×6m-distance magic graphs. This study also concludes the orientable group distance magic labeling of direct product of the said directed graphs.

AB - A directed graph G is said to have the orientable group distance magic labeling if there exists an abelian group and one-one map ℓ from the vertex set of G to the group elements, such that y NG+xy-y NG-xy=μ for all x V, where NGx is the open neighborhood of x, and μ is the magic constant; more specifically, such graph is called orientable -distance magic graph. In this study, we prove directed antiprism graphs are orientable 2n, 2×n, and 3×6m-distance magic graphs. This study also concludes the orientable group distance magic labeling of direct product of the said directed graphs.

UR - http://www.scopus.com/inward/record.url?scp=85125834662&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85125834662&partnerID=8YFLogxK

U2 - 10.1155/2022/3536356

DO - 10.1155/2022/3536356

M3 - Article

AN - SCOPUS:85125834662

SN - 1024-123X

VL - 2022

JO - Mathematical Problems in Engineering

JF - Mathematical Problems in Engineering

M1 - 3536356

ER -