arXiv Analytics

Sign in

arXiv:1407.4869 [math.CO]AbstractReferencesReviewsResources

The Sparing Number of the Cartesian Products of Certain Graphs

K. P. Chithra, K. A. Germina, N. K. Sudev

Published 2014-07-18Version 1

Let $\mathbb{N}_0$ be the set of all non-negative integers. An integer additive set-indexer (IASI) is defined as an injective function $f:V(G)\rightarrow \mathcal{P}(\mathbb{N}_0)$ such that the induced function $f^+:E(G) \rightarrow \mathcal{P}(\mathbb{N}_0)$ defined by $f^+ (uv) = f(u)+ f(v)$ is also injective, where $f(u)+f(v)$ is the sumset of $f(u)$ and $f(v)$ and $\mathcal{P}(\mathbb{N}_0)$ is the power set of $\mathbb{N}_0$. If $f^+(uv)=k \forall ~ uv\in E(G)$, then $f$ is said to be a $k$-uniform integer additive set-indexer. An integer additive set-indexer $f$ is said to be a weak integer additive set-indexer if $|f^+(uv)|=max(|f(u)|,|f(v)|) \forall ~ uv\in E(G)$. In this paper, we study about the sparing number of the cartesian product of two graphs.

Comments: 8 pages, published. arXiv admin note: substantial text overlap with arXiv:1311.0858
Journal: Communications in Mathematics and Applications, Vol.5 Issue 1, 2014, 23-30
Categories: math.CO
Subjects: 05C78
Related articles: Most relevant | Search more
arXiv:1504.01975 [math.CO] (Published 2015-04-08)
On the b-chromatic number of the Cartesian product of two complete graphs
arXiv:1504.05012 [math.CO] (Published 2015-04-20)
Polynomials vanishing on Cartesian products: The Elekes-Szabó Theorem revisited
arXiv:0711.1189 [math.CO] (Published 2007-11-08, updated 2011-09-23)
Clique Minors in Cartesian Products of Graphs