For all terms and definitions, not defined specifically in this paper, we refer to [4], [5] and [9] and for more about graph labeling, we refer to [6]. Unless mentioned otherwise, all graphs considered here are simple, finite and have no isolated vertices
International audienceLet N 0 be the set of all non-negative integers and P(N 0) be its power set. A...
For a non-empty ground setX, finite or infinite, the set-valuation or set-labeling of a given graph ...
Let X denotes a set of non-negative integers and P(X) be its power set. An integer additive set-labe...
A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a fi...
Let \(\mathbb{N}_0\) denote the set of all non-negative integers and \(X\) be any non-empty subset o...
International audienceA set-labelling of a graph G is an injective function f : V (G) → P(X), where ...
Let $ \mathbb N _0 $ be the set of all non-negative integers and $ \fancyscript {P} $ be its power s...
International audienceLet N 0 denote the set of all non-negative integers and P(N 0) be its power se...
A set-labeling of a graph G is an injective function f: V (G) → P(X), where X is a finite set and a ...
International audienceLet ℕ0 denote the set of all non-negative integers and P(ℕ0) be its power set....
A set-labeling of a graph G is an injective function f: V (G) → P(X), where X is a finite set and a...
For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph...
International audienceLet N 0 be the set of all non-negative integers and P(N 0) be its power set. A...
Let N0 denote the set of all non-negative integers and X be any subset of X. Also denote the power s...
International audienceLet X denotes a set of non-negative integers and P(X) be its power set. An int...
International audienceLet N 0 be the set of all non-negative integers and P(N 0) be its power set. A...
For a non-empty ground setX, finite or infinite, the set-valuation or set-labeling of a given graph ...
Let X denotes a set of non-negative integers and P(X) be its power set. An integer additive set-labe...
A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a fi...
Let \(\mathbb{N}_0\) denote the set of all non-negative integers and \(X\) be any non-empty subset o...
International audienceA set-labelling of a graph G is an injective function f : V (G) → P(X), where ...
Let $ \mathbb N _0 $ be the set of all non-negative integers and $ \fancyscript {P} $ be its power s...
International audienceLet N 0 denote the set of all non-negative integers and P(N 0) be its power se...
A set-labeling of a graph G is an injective function f: V (G) → P(X), where X is a finite set and a ...
International audienceLet ℕ0 denote the set of all non-negative integers and P(ℕ0) be its power set....
A set-labeling of a graph G is an injective function f: V (G) → P(X), where X is a finite set and a...
For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph...
International audienceLet N 0 be the set of all non-negative integers and P(N 0) be its power set. A...
Let N0 denote the set of all non-negative integers and X be any subset of X. Also denote the power s...
International audienceLet X denotes a set of non-negative integers and P(X) be its power set. An int...
International audienceLet N 0 be the set of all non-negative integers and P(N 0) be its power set. A...
For a non-empty ground setX, finite or infinite, the set-valuation or set-labeling of a given graph ...
Let X denotes a set of non-negative integers and P(X) be its power set. An integer additive set-labe...
DOI
Add to ORKG