Orientable Group Distance Magic Labeling of Directed Graphs

Wasim Ashraf, Hani Shaker, Muhammad Imran and Tabasam Rashid

Mathematical Problems in Engineering, 2022, vol. 2022, 1-5

Abstract: 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+xℓ⟶y−∑y∈NG−xℓ⟶y=μ 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.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/mpe/2022/3536356.pdf (application/pdf)
http://downloads.hindawi.com/journals/mpe/2022/3536356.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:3536356

DOI: 10.1155/2022/3536356

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().