On the Sparing Number of Certain Graph Structures

International audienceAn integer additive set-indexer (IASI) is defined as an injective function : 2 such that the induced function : 2 defined by is also injective. An IASI is said to bea weak IASI if | | ||, || for all ,. A graph which admits a weak IASI may be called a weak IASI graph. The sparing number of a graph is the minimum number of edges, with the singleton set-label, required for to admit a weak IASI. In this paper, we study about the sparing number of certain graph structures