Da Fonseca C.M.; Saenpholphat V.; Zhang P.
(2013)
For any graph G of order n and size m, a γ-labeling of G is defined as a one-to-one function f: V(G) → {0, 1, ..., m} that induces an edge-labeling f′: E(G) → {1, 2, ..., m} on G defined by f′(uv) = |f(u) - f(v)|, for each ...