Saduakdee S.; Khemmani V.
(2018)
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 an edge-labeling f′: E(G) → {1, 2, …, m} on G defined by f′ (e) = |f(u) − f(v)|, for each edge e = ...