Let N0 be the set of all non-negative integers and P(N0) be its power set. Then, an integer additive set-indexer (IASI) of a given graph G is defined as an injective function f : V (G) → P(N0) such that the induced edge-function f : E(G) → P(N0) defined by f(uv) = f(u) + f(v) is also injective, where f(u) + f(v) is the sumset of f(u) and f(v). An IASI f of G is said to be a strong IASI of G if ...