The Exquisite Integer Additive Set-Labeling of Graphs

Let N_0 denote the set of all non-negative integers and P (N_0) be its power set. An integer additive set-indexer (IASI) of a graph G is an injective function fV (G) -P (N_0) such that the induced function f^+E (G) -P (N_0) defined by f^+ (uv) =f (u) +f (v) is also injective, where f (u) +f (v) is the sum set of f (u) and f (v). If f^+ (uv) =k - uv-E (G), then f is said to be a k-uniform integer additive set-indexer. In this paper, we study the admissibility of a particular type of integer additive set-indexers by certain graphs.