Graph Labelings via Abelian Groups

Abstract

2017. For any graph ? = ( ?,? ) o f orde r ? , whic h i s oriente d ther e i s bijectio n ?++⃗: ? ( ? ) → Г ? ∈ ?(?), defines a directed group distance magic labelling. The property that there e x ists ? ∈ Г (referred to as the magic constant) We say that a graph G is orientable group distance magic if there is an orientation in ? for group distance magic labeling G. In this thesis we used direct product of directed graph antiprism and cycles to show that that their triple product has orientable group distance magic labeling by using the different module groups; ?