Some New Results on Weak Integer Additive Set-Labeling of Graphs
Sudev Naduvath, K. A. Germina · International Journal of Computer Applications · 2015
Let N 0 denote the set of all non-negative integers and P(N 0 ) be its power set.An integer additive set-labeling (IASL) of a graphAn IASL f is said to be an integer additive set-indexer (IASI) if the associated edge-function f + is also injective.An IASL f of a given graph G is said to be a weak integer additive set-labeling (WIASL) of G if the cardinality of the set-label of every edge of G is equal to the cardinality of the set-label of at least one end vertex of it.In this paper, we study the admissibility of weak integer additive set-labeling by different graphs.