A Study on the Sparing Number of the Corona of Certain Graphs

Abstract: An integer additive set-indexer (IASI) is defined as an injective function

f : V (G) i g h t a r r o w m a t h c a l P (m a t h b b N_{0})

such that the induced function

f^{+} : E (G) i g h t a r r o w m a t h c a l P (m a t h b b N_{0})

defined by

f^{+} (u v) = f (u) + f (v)

is also injective, where

f (u) + f (v)

is the sumset of

f (u)

and

f (v)

and

m a t h c a l P (m a t h b b N_{0})

is the power set of

m a t h b b N_{0}

. If

f^{+} (u v) = k f o r a l l u v i n E (G)

, then

f

is said to be a

k

-uniform integer additive set-indexer. An integer additive set-indexer

f

is said to be a weak integer additive set-indexer if

| f^{+} (u v) | = m a x (| f (u) |, | f (v) |) f o r a l l u v i n E (G)

. We have some characteristics of the graphs which admit weak integer additive set-indexers. In this paper, we study about the sparing number of the corona of two graphs.

This page was built for publication: A Study on the Sparing Number of the Corona of Certain Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6253263)