DISTANCE MAGIC LABELING USING ALGEBRAIC APPROACH

• Main Author: Wayan Palton Anuwiksa, I
• Format: Final Project
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/44309
• Institution: Institut Teknologi Bandung

Let G be a graph with order n and diameter d. Let D?{0,1,2,…,d} and N_D (v)={u?V(G) ?|d(u,v)?D}, where v?V(G). A bijection l?V(G)?{1,2,…,n} is called D-distance magic labeling of G if there is a nonnegative integer k such that ?_(u?N_D (v))??l(u)?=k for every v?V(G). If D={1}, D-distance magic labe...