Corpus ID: 76649055

# Weak Integer Additive Set-Indexers of Certain Graph Operations

@article{Sudev2013WeakIA,
title={Weak Integer Additive Set-Indexers of Certain Graph Operations},
author={Naduvath Sudev and K. A. Germina},
journal={arXiv: Combinatorics},
year={2013}
}
• Published 23 October 2013
• Mathematics
• arXiv: Combinatorics
An integer additive set-indexer is defined as an injective function $f:V(G)\rightarrow 2^{\mathbb{N}_0}$ such that the induced function $g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by $g_f (uv) = f(u)+ f(v)$ is also injective, where $f(u)+f(v)$ is the sum set of $f(u)$ and $f(v)$ and $\mathbb{N}_0$ is the set of all non-negative integers. If $g_f(uv)=k \forall uv\in E(G)$, then $f$ is said to be a $k$-uniform integer additive set-indexers. An integer additive set-indexer $f$ is said to be a… Expand
8 Citations
A Note on the Sparing Number of Graphs
• Mathematics
• 2014
An integer additive set-indexer is defined as an injective function $f:V(G)\rightarrow 2^{\mathbb{N}_0}$ such that the induced function $g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by $g_f (uv) =Expand A Note on the Sparing Number of the Sieve Graphs of Certain Graphs • Mathematics • 2015 Let$\mathbb{N}_0$denote the set of all non-negative integers and$\mathcal{P}(\mathbb{N}_0)$be its power set. An integer additive set-indexer (IASI) of a given graph$G$is an injective functionExpand Further Studies on the Sparing Number of Graphs • Mathematics • 2014 Let$\mathbb{N}_0$denote the set of all non-negative integers and$\mathcal{P}(\mathbb{N}_0)$be its power set. An integer additive set-indexer is an injective function$f:V(G)\toExpand
Weak Integer Additive Set-Indexed Graphs: A Creative Review
• Mathematics
• 2014
For a non-empty ground set $X$, finite or infinite, the {\em set-valuation} or {\em set-labeling} of a given graph $G$ is an injective function $f:V(G) \to \mathcal{P}(X)$, where $\mathcal{P}(X)$ isExpand
Weak Set-Labeling Number of Certain Integer Additive Set-Labeled Graphs
• Computer Science
• 2015
The notion of theWeak set-labeling number of a graph G is introduced as the minimum cardinality of X so that G admits a WIASL with respect to the ground set X and the weak set- labeling numbers of certain graphs are discussed. Expand
On Weak Integer Additive Set-Indexers of Certain Graph Classes
• Mathematics
• 2014
Abstract Let ℕ0 denote the set of all non-negative integers and P (ℕ0) be its power set. An integer additive set-indexer (IASI) of a graph G is an injective function f : V (G) → P (ℕ0) such that theExpand
The sparing number of certain graph powers
• Mathematics
• Acta Universitatis Sapientiae, Mathematica
• 2019
Abstract Let ℕ0 be the set of all non-negative integers and 𝒫(ℕ0) be its power set. Then, an integer additive set-indexer (IASI) of a given graph G is an injective function f : V(G) → P(ℕ0) suchExpand
Some New Results on Weak Integer Additive Set-Indexers of Graph Powers
• Mathematics
• 2014
An integer additive set-indexer is defined as an injective function $f:V(G)\rightarrow 2^{\mathbb{N}_0}$ such that the induced function $g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by \$g_f (uv) =Expand