On Group Labeling of Antiprism Graphs

Abstract

Assume a graph G with n vertices and Λ be any abelian group having n elements. Group distance magic labeling of G is a bijective map f: V → Λsuch that ∃μ∈Λ for that ∑ ∈ ( ) ( ) = ∀ v ∈ V, where are the vertices adjacent to v. In this thesis , we find the × × × , × × × , × × × , × × × , × × × , × × × , group distance magic labeling for antiprism graph !