The Sparing Number of the Cartesian Products of Certain Graphs

preprint2014arXivOpen access

Abstract

Let N0\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)→P(N0)f:V(G)\rightarrow \mathcal{P}(\mathbb{N}_0) such that the induced function f+:E(G)→P(N0)f^+:E(G) \rightarrow \mathcal{P}(\mathbb{N}_0) defined by f+(uv)=f(u)+f(v)f^+ (uv) = f(u)+ f(v) is also injective, where f(u)+f(v)f(u)+f(v) is the sumset of f(u)f(u) and f(v)f(v) and P(N0)\mathcal{P}(\mathbb{N}_0) is the power set of N0\mathbb{N}_0. If f+(uv)=k∀ uv∈E(G)f^+(uv)=k \forall ~ uv\in E(G), then ff is said to be a kk-uniform integer additive set-indexer. An integer additive set-indexer ff is said to be a weak integer additive set-indexer if ∣f+(uv)∣=max(∣f(u)∣,∣f(v)∣)∀ uv∈E(G)|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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.