Arithmetic Intger Additive Set-Idexers of Graph Operations

Abstract

An integer additive set-indexer is an injective function $f:V(G)\to 2^{{\mathbb{N}}_0}$ such that the induced function $g_f:E(G)\to 2^{{\mathbb{N}}_0}$ defined by $g_f(uv)=f(u)+f(v)$ is also injective. A graph $G$ which admits an IASI is called an IASI graph. An arithmetic integer additive set-indexer is an integer additive set-indexer $f$, under which the set-labels of all elements of a given graph $G$ are arithmetic progressions. In this paper, we discuss about admissibility of arithmetic integer additive set-indexers by certain graph operations and certain products of graphs.

10 pages, submitted. arXiv admin note: substantial text overlap with arXiv:1401.6040, arXiv:1405.6617, arXiv:1312.7674

References in corpus (1)

• On Certain Arithmetic Integer Additive set-indexers of Graphs