D-MAGIC LABELING FOR TREES

• 主要作者: Bagus Gede Baskara S, Ida
• 格式: Final Project
• 語言: Indonesia
• 在線閱讀: https://digilib.itb.ac.id/gdl/view/65262
• 機構: Institut Teknologi Bandung

Let G = (V (G),E(G)) be a finite, simple, and undirected graph with n vertices. For a vertex u ? V (G), a set ND(u) = {v ? V (G) : d(u, v) ? D} is called the neighbourhood of distance D of u. A bijection f : V (G) ? {1, 2, ..., n} is called the D-magic labeling of G if there is a k such that P...