A set-labeling of a graph $ G $ is an injective function $ f: V (G)\to\mathcal {P}(X) $, where $
X $ is a finite set and a set-indexer of $ G $ is a set-labeling such that the induced function …

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 …

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 ℕ𝟎 denote the set of all non-negative integers and 𝓟 (ℕ𝟎) be its power set. An integer
additive set-indexer (IASI) of a graph 𝑮 is an injective function 𝒇: 𝑽 (𝑮)→ 𝓟 (ℕ𝟎) such that …

Let and be the power set. An injection is an integer additive set-indexer of a graph if the
induced map given by is also an injection, where is the sumset of and Moreover, if, for all uv …

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 …

Abstract Let N0= N∪{0} and P (N0) be the power set. If f: V (G)→ P (N0), then its induced
map f+: E (G)→ P (N0) is defined as f+(uv)= f (u)+ f (v) where f (u)+ f (v) is the sumset of f (u) …

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

The aim of this paper is to introduce a new function that satisfies the property of topological
integer additive set-indexer (Top-IASI) with minimum cardinality for pan, tadpole, path and …