Graph labelling is an assignment of labels to the vertices and/or edges of a graph with
respect to certain restrictions and in accordance with certain predefined rules. The sumset of …

Let $\mathbb {N} _0 $ be the set of all non-negative integers and $\mathcal {P}(\mathbb {N}
_0) $ be its the power set. An integer additive set-indexer (IASI) of a graph $ G $ is an …

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

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

Let N0 denote the set of all non-negative integers and P (N0) be its power set. An integer
additive set-labeling (IASL) of a graph G is an injective function f: V (G)→ P (N0) such that …

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)→ 𝒫 (X), where 𝒫 (X) is the power set of the set X. A …

Let $\mathbb {N} _0 $ be the set of all non-negative integers, let $ X\subset\mathbb {N} _0 $
and $\mathcal {P}(X) $ be the the power set of $ X $. An integer additive set-labeling (IASL) …

Let $\mathbb {N} _0 $ denote the set of all non-negative integers and $\mathcal {P}(\mathbb
{N} _0) $ be its power set. An integer additive set-indexer is an injective function $ f: V …

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 …

Let $\mathbb {N} _0 $ be the set of all non-negative integers. An integer additive set-indexer
(IASI) is defined as an injective function $ f: V (G)\rightarrow\mathcal {P}(\mathbb {N} _0) …