Let X denotes a set of non-negative integers and P(X) be its power set. An integer additive set-labeling (IASL) of a graph G is an injective set-valued function f : V (G) → P(X) − {∅} such that the induced function f+ : E(G) → P(X) − {∅} is defined by f+(uv) = f(u) + f(v); ∀ uv ∈ E(G), where f(u) + f(v) is the sumset of f(u) and f(v). An IASL of a signed graph is an IASL of its underlying graph G together with the signature σ defined by σ(uv) = (−1)|f+(uv)|; ∀ uv ∈ E(Σ). In this paper, we discuss certain characteristics of the signed graphs which admits certain types of integer additive set-labelings.Publisher's Versio
Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-i...
International audienceLet X be a non-empty set and let Σ be a signed graph, with corresponding under...
For all terms and definitions, not defined specifically in this paper, we refer to [4], [5] and [9] ...
International audienceLet X denotes a set of non-negative integers and P(X) be its power set. An int...
Let N0 denote the set of all non-negative integers and P(N0) be its power set. An integer additive s...
Let $ \mathbb N _0 $ be the set of all non-negative integers and $ \fancyscript {P} $ be its power s...
Let N0 denote the set of all non-negative integers and X be any subset of X. Also denote the power s...
Let \(\mathbb{N}_0\) denote the set of all non-negative integers and \(X\) be any non-empty subset o...
For a non-empty ground setX, finite or infinite, the set-valuation or set-labeling of a given graph ...
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 ...
Let N0 be the set of all non-negative integers, let X ⊂ N0 andP(X) be the the power set of X. An int...
For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph...
A set-labeling of a graph G is an injective function f: V (G) → P(X), where X is a finite set and a...
A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a fi...
Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-i...
International audienceLet X be a non-empty set and let Σ be a signed graph, with corresponding under...
For all terms and definitions, not defined specifically in this paper, we refer to [4], [5] and [9] ...
International audienceLet X denotes a set of non-negative integers and P(X) be its power set. An int...
Let N0 denote the set of all non-negative integers and P(N0) be its power set. An integer additive s...
Let $ \mathbb N _0 $ be the set of all non-negative integers and $ \fancyscript {P} $ be its power s...
Let N0 denote the set of all non-negative integers and X be any subset of X. Also denote the power s...
Let \(\mathbb{N}_0\) denote the set of all non-negative integers and \(X\) be any non-empty subset o...
For a non-empty ground setX, finite or infinite, the set-valuation or set-labeling of a given graph ...
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 ...
Let N0 be the set of all non-negative integers, let X ⊂ N0 andP(X) be the the power set of X. An int...
For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph...
A set-labeling of a graph G is an injective function f: V (G) → P(X), where X is a finite set and a...
A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a fi...
Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-i...
International audienceLet X be a non-empty set and let Σ be a signed graph, with corresponding under...
For all terms and definitions, not defined specifically in this paper, we refer to [4], [5] and [9] ...