×ABSTRAK
A graph explained set of points called vertices and together with lines called edge. A labeling of a graph G of order |V(G)| and size |E(G)| is a one-to-one function, f : V(G){ 0, 1, 2, ..., |E(G)| } that induces a labeling f’ : E(G) { 1, 2, ..., |E(G)| } of the edges of G, f’(e) = | f (u) – f (v) for edge e = uv of G. Value of labeling f denoted by val(f) = . The maximum value of labeling of G is defined by valmax(G) = max{val(f) : f is a labeling of G}. And the minimum value of labeling of G is defined by valmin(G) = min {val(f) : f is a labeling of G}.
The aims of research are to describe labeling of path and cycle and resulting of the maximum and minimum values. The method on this research is a literary study.
The result shows that
1. valmin (Pn) = n – 1, valmax(Pn) = for every integer n ≥ 2
2.valmin(Cn) = 2(n - 1), valmax(Cn) = for every odd integer n ≥ 3 and valmax(Cn) = for every even integer n ≥ 4.
