Da Fonseca C.M.; Saenpholphat V.; Zhang P.
(2011)
Let G 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,..., m} of the edges of G defined by f′(e) = |f(u) -f(v)| for each edge ...