On γ-Labeling of (n,t)-Kite Graph
Diari Indriati · 2011
Let G(V,E) be a graph of order n and size m. A -labeling of G is a one-to-one function f: V(G) {0, 1, 2, …, m} that induces a labeling f’: E(G) {1, 2, 3, …, m} of the edges of G defined by f’(e) = |f(u)-f(v)| for each edge e = uv of G. The value of a -labeling f is denoted by val(f) = eEf’(e). The maximum value of a -labeling of G is defined by valmax(G) = max{val(f) : f is a - labeling of G}, while the minimum value of a -labeling of G is defined by valmin (G) = min{val(f) : f is a - labeling of G}. In this paper we investigate the valmin(G) of an (n,t)-kite graph G for every integer n 3, and the lower bound of the valmax(G) of an (n,t)-kite graphs G for n =3 and n=4.