PELABELAN ANTIPODAL PADA GRAF SIKEL

Let G be a graph with diameter d . An antipodal labelings of G is a function f that assigns to each vertex a non-negative integer (label) such that for any two vertices u and v, it is satisfied that f u −f(v) ≥ d −d(u ,v), where d(u,v) is the distance between u and v. Let Cn denote the cycle graph on n vertices, antipodal labelings gives an ordering of the vertices x0 , x1, ... ,xn−1 by permutation π then determine label of every vertices with f(xo),f(x1),f(x2),... , f(xn−1). Antipodal labelings sustain that antipodal vertices have the same label. The span of an antipodal labeling f is max f u −f v :u, v ∈ V(G) . The antipodal number for G denoted by an(G) is the min imum span of an antipodal labeling for G. In this essay we learning step of antipodal labelings for cycle Cn so that antipodal number of cycle graph can be seen.