Some New Results on Strong Integer Additive Set-Indexers of Graphs
N K Sudev, K A Germina · 2016
An integer additive set-indexer is defined as an injective function f: V (G) → 2N0 such that the induced function gf: E(G) → 2N0 defined by gf (uv) = f(u)+f(v) is also injective. An IASI is said to be k-uniform if |gf (e) | = k for all e ∈ E(G). In this paper, we introduce the notions of strong integer additive set-indexers, strongly uniform integer additive set-indexers and completely uniform integer additive set-indexers and initiate a study of the graphs which admit these types of set-indexers. Key words: Integer additive set-indexers, weak integer additive set-indexers, mono-indexed elements of a graph, sparing number of a graph. Key words: Integer additive set-indexers, weak integer additive set-indexers, mono-indexed elements of a graph, sparing number of a graph. AMS Subject Classification: 05C78 1