Let G be a graph with q edges. A function f is called a β-labeling of G if f is a
one-to-one from the set of vertices of G to the set {0, 1, 2, . . . , q}, when each edges uv is
assigned the label |f(u) − f(v)|, the resulting edges labels are distinct.
Let f be a β-labeling of G. If there exists an integer λ so that for each edge uv belong to E(G),
either f(u)≦λ