
doi: 10.1155/2022/3536356
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 ∈ N G + x ℓ ⟶ y − ∑ y ∈ N G − x ℓ ⟶ y = μ for all x ∈ V , where N G x 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 ℤ 2 n , ℤ 2 × ℤ n , and ℤ 3 × ℤ 6 m -distance magic graphs. This study also concludes the orientable group distance magic labeling of direct product of the said directed graphs.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
