Orientable Group Distance Magic Labeling of Directed Graphs

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;...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical problems in engineering 2022-02, Vol.2022, p.1-5
Hauptverfasser:	Ashraf, Wasim, Shaker, Hani, Imran, Muhammad
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Graph theory Graphs Group theory Labeling Mathematical problems Vertex sets
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!