Cek Similarity PELABELAN ANTI AJAIB JARAK PADA SUATU GRAF PETERSEN DIPERUMUM

Abstract

One type of graph labeling is distance labeling which is labelled a graph based on the distance between the vertices. This distance labeling is called distance magic labeling (magic labeling distance) if each vertex has the same distance labeling weights. The distance labeling is called distance antimagic labeling if each vertex has different distance labeling weights, formed an arithmetic progressivea, a+d, a+2d, ... ,a+(n-1)d, whered > 0. This paper discusses the anti-magic labeling distance on generalizedPetersen graph, denoteG = P (n, m) with n ≥3, 1 ≤m <n / 2, a regular graph with degree 3 that has 2n verticesand 3n edges. More over, this paper alsodiscuss about(a, d)-distance anti-magic labeling on generalized Petersen grap