Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Jurnal Matematika UNAND
Bonardo Lubis
Universitas Indonesia
Computer Science & IT Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Distance Antimagic Labeling for Copies of Graph Peter John; Bonardo Lubis; Kiki Ariyanti Sugeng
Jurnal Matematika UNAND Vol. 15 No. 3 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.15.3.319-324.2026

Abstract

Let G be a graph with vertex set V(G) and edge set E(G). Let f be a bijective function from the vertex set V(G) to the set {1,2,3,... ,|V(G)|} and weight of vertex v in V(G) is the sum of labels of all neighbors of vertex v. If there is no pair of vertices of V(G) have equal weight, then f is called a distance antimagic labeling and G is called a distance antimagic graph. Copies of graph G, denoted as nG is disjoint union of n graphs which each is isomorphic to G. In this paper, we present several results on distance antimagic labeling of copies of graph.
Co-Authors Kiki Ariyanti Sugeng Peter John