A Characterisation of weak integer additive Set-Indexers of graphs

An integer additive set-indexer is defined as an injective function such that the induced function defined by is also injective. An integer additive set-indexer is said to be k -uniform if for all . An integer additive set-indexer is said to be a weak integer additive set-indexer if for all . In this paper, we study the characteristics of certain graphs and graph classes which admit weak integer additive set-indexers.