PENGEMBANGAN SISTEM KODEFIKASI MODEL-MODEL TOPOLOGI JARINGAN DISKONEKTIF DENGAN TEKNIK SUPER EDGE ANTIMAGIC TOTAL LABELING (SEATL) (The Development of Coding System of Disconnected Network Topology Models by Super Edge Antimagic Total Labeling (SEATL) Technique)

Abstract

Abstract In the advance of computer networks, communication and transportation, the scalability of networks was hampered by the high latency and the lack of bandwith as well as a security issue. Therefore, the study of the design of large interconnection networks is significantly useful. In the communication network design, the problem of a security issue can be resolved by assigning a label of network. Thus, the graph labeling is important to study. Let G be a simple graph of order |V | and size |E|. An (a,d)-edge-antimagic total labeling of G is a oneto-one mapping f taking the vertices and edges onto {1, 2, ..., |V | + |E|} such that the edge- weights w(uv) = f(u)+f(v)+f(uv), uv ∈ E(G) form an arithmetic sequence {a, a + d,..., a + (|E| − 1)d}, where the first term 𝑎 > 0 and the common difference 𝑑 ≥ 0. Such a labeling is called super if the smallest possible labels appear on the vertices.