A set-indexer of a graph $ G $ is an injective set-valued function $ f: V (G)\rightarrow2^{X} $
such that the function $ f^{\oplus}: E (G)\rightarrow2^{X}-\{\emptyset\} $ defined by …

Let ℕ0 denote the set of all non-negative integers and 𝒫 (ℕ0) be its power set. An integer
additive set-indexer (IASI) of a graph G is an injective function f: V (G)→ 𝒫 (ℕ0) such that the …

Let $ X $ be a non-empty ground set and $\mathcal {P}(X) $ be its power set. A set-labeling
(or a set-valuation) of a graph $ G $ is an injective set-valued function $ f: V (G)\to\mathcal …

Graph labelling is an assignment of labels or weights to the vertices and/or edges of a
graph. For a ground set X of integers, a sumset labelling of a graph is an injective mapf: VG …

An integer additive set-indexer is defined as an injective function $ f: V (G)\rightarrow
2^{\mathbb {N} _0} $ such that the induced function $ f^+: E (G)\rightarrow 2^{\mathbb {N} …

Let N0 be the set of all non-negative integers and P (N0) be its power set. An integer
additive set-indexer (IASI) is defined as an injective function such that the induced function …

Let X denote a set of non-negative integers and 𝒫 (X) be its power set. An integer additive
set-labeling (IASL) of a graph G is an injective set-valued function f: V (G)→ 𝒫 (X)−{∅} such …

An integer additive set-indexer is an injective function $ f: V (G)\to 2^{\mathbb {N} _0} $ such
that the induced function $ g_f: E (G)\to 2^{\mathbb {N} _0} $ defined by $ g_f (uv)= f (u)+ f (v) …

Let X be a non-empty ground set and 𝒫⁢(X) be its power set. A set-labeling (or a set-
valuation) of a graph G is an injective set-valued function f: V⁢(G)→ 𝒫⁢(X) such that the …

For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given
graph G is an injective function f: V (G)→ P (X), where P (X) is the power set of the set X. A …