Let N0 denote the set of all non-negative integers and
P(N0) be its power set. An integer additive set-indexer
is an injective function f:V(G)→P(N0) such that the
induced function f+:E(G)→P(N0) 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. An integer additive set-indexer f is said to be
a weak integer additive set-indexer if ∣f+(uv)∣=max(∣f(u)∣,∣f(v)∣)∀uv∈E(G). In this paper, we study the admissibility of weak integer additive
set-indexer by certain graphs and graph operations.Comment: 10 Pages, Submitted. arXiv admin note: substantial text overlap with
arXiv:1310.609