A set-labeling of a graph G is an injective function f: V (G)→ P (X), where X is a finite set of
non-negative integers and a set-indexer of G is a set-labeling such that the induced function …

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 $\N $ denote the set of all non-negative integers and $\cP (\N) $ be its power set. An
integer additive set-labeling (IASL) of a graph $ G $ is an injective set-valued function $ f: V …

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

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

Let $\mathbb {N} _0 $ denote the set of all non-negative integers and $ X $ be any subset of
$ X $. Also denote the power set of $ X $ by $\mathcal {P}(X) $. An integer additive set …

Let í µí±denote a set of non-negative integers and í µí±0 (í µí±) be the collection of all non-
empty subsets of í µí±. An integer additive set-labeling (IASL) of a graph í µí° º is an injective …

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 set-valued function f: V (G)→ P …

The sumset of two sets A and B of integers, denoted by A+ B, is defined as A+ B={a+ b: a∈
A, b∈ B}. Let X be a non-empty set of non-negative integers. A sumset labelling of a graph G …

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