Weakly Integer Additive Set Indexers of Cartesian Product of Graphs

摘要

Let G(V, E) be a graph of order p and size q. An integer additive set-indexer (IASI) is defined as an injective function f: V(G) →2~(Z~+) such that the induced function f~+: E(G) →2~(Z~+) defined by f~+(uv) = f(u)+f(v) is also injective. If | f~+(uv)| =k for all uv∈ E(G) then f is said to k-uniform IASI. An IASI f is said to be weak IASI if | f~+(uv) |=max | |f(u)|, |f(v)| | for all uv∈ E(G). In this paper, we study the admissibility of weak IASI for Cartesian Product of some graphs.