On the Sparing Number of the Edge-Corona of Graphs

preprint2015arXivOpen access

Abstract

Let N0\mathbb{N}_0 be the set of all non-negative integers and P(N0)\mathcal{P}(\mathbb{N}_0) be its the power set. An integer additive set-indexer (IASI) of a graph GG is an injective function f:V(G)→P(N0)f:V(G)\to \mathcal{P}(\mathbb{N}_0) such that the induced function f+:E(G)→P(N0)f^+:E(G) \to \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 sum set of f(u)f(u) and f(v)f(v). An integer additive set-indexer ff is said to be a weak integer additive set-indexer (weak IASI) if ∣f+(uv)∣=max⁡(∣f(u)∣,∣f(v)∣) ∀ uv∈E(G)|f^+(uv)|=\max(|f(u)|,|f(v)|)~\forall ~ uv\in E(G). The minimum number of singleton set-labeled edges required for the graph GG to admit an IASI is called the sparing number of the graph. In this paper, we discuss the admissibility of weak IASI by a particular type of graph product called the edge corona of two given graphs and determine the sparing number of the edge corona of certain 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.