Let N0 denote the set of all non-negative integers and X be any subset of X. Also denote the power set of X by P(X). An in-teger additive set-labeling (IASL) of a graph G is an injective 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), where f(u) + f(v) is the sumset of f(u) and f(v). An IASL f is said to be a topological IASL (Top-IASL) if f(V (G)) ∪ {∅} is a topology of the ground set X. An IASL is said to be an inte-ger additive set-graceful labeling (IASGL) if for the induced edge-function f+, f+(E(G)) = P(X)−{∅, {0}}. In this paper, we study certain types of IASL of a given graph G, which is a topo-logical integer additive set-labeling as well as an integer additive set-gr...
For all terms and definitions, not defined specifically in this paper, we refer to [4], [5] and [9] ...
Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-i...
An integer additive set-indexer is defined as an injective function f: V (G) → 2N0 such that the in...
Let (mathbb{N}_0) denote the set of all non-negative integers and (X) be any non-empty subset of (ma...
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) → P(X), where X is a finite set and a...
Let $ \mathbb N _0 $ be the set of all non-negative integers and $ \fancyscript {P} $ be its power s...
A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a fi...
Let X denotes a set of non-negative integers and P(X) be its power set. An integer additive set-labe...
Let N0 denote the set of all non-negative integers and P(N0) be its power set. An integer additive s...
For a non-empty ground setX, finite or infinite, the set-valuation or set-labeling of a given graph ...
Let N0 be the set of all non-negative integers, let X ⊂ N0 andP(X) be the the power set of X. An int...
International audienceLet N 0 denote the set of all non-negative integers and P(N 0) be its power se...
For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph...
International audienceLet X denotes a set of non-negative integers and P(X) be its power set. An int...
For all terms and definitions, not defined specifically in this paper, we refer to [4], [5] and [9] ...
Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-i...
An integer additive set-indexer is defined as an injective function f: V (G) → 2N0 such that the in...
Let (mathbb{N}_0) denote the set of all non-negative integers and (X) be any non-empty subset of (ma...
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) → P(X), where X is a finite set and a...
Let $ \mathbb N _0 $ be the set of all non-negative integers and $ \fancyscript {P} $ be its power s...
A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a fi...
Let X denotes a set of non-negative integers and P(X) be its power set. An integer additive set-labe...
Let N0 denote the set of all non-negative integers and P(N0) be its power set. An integer additive s...
For a non-empty ground setX, finite or infinite, the set-valuation or set-labeling of a given graph ...
Let N0 be the set of all non-negative integers, let X ⊂ N0 andP(X) be the the power set of X. An int...
International audienceLet N 0 denote the set of all non-negative integers and P(N 0) be its power se...
For a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph...
International audienceLet X denotes a set of non-negative integers and P(X) be its power set. An int...
For all terms and definitions, not defined specifically in this paper, we refer to [4], [5] and [9] ...
Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-i...
An integer additive set-indexer is defined as an injective function f: V (G) → 2N0 such that the in...