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 f is said to be a weak IASI if
β£gfβ(uv)β£=max(β£f(u)β£,β£f(v)β£) for all u,vβV(G). A graph which admits a
weak IASI may be called a weak IASI graph. The set-indexing number of an
element of a graph G, a vertex or an edge, is the cardinality of its
set-labels. The sparing number of a graph G is the minimum number of edges
with singleton set-labels, required for a graph G to admit a weak IASI. In
this paper, we study the sparing number of certain graphs and the relation of
sparing number with some other parameters like matching number, chromatic
number, covering number, independence number etc.Comment: 10 pages, 10 figures, submitte