A study on prime arithmetic integer additive set-indexers of graphs

Abstract: Let

m a t h b b N_{0}

be the set of all non-negative integers and

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

be its power set. An integer additive set-indexer (IASI) is defined as an injective function

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

such that the induced function

f^{+} : E (G) o 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

m a t h b b N_{0}

is the set of all non-negative integers. A graph

G

which admits an IASI is called an IASI graph. An IASI of a graph

G

is said to be an arithmetic IASI if the elements of the set-labels of all vertices and edges of

G

are in arithmetic progressions. In this paper, we discuss about a particular type of arithmetic IASI called prime arithmetic IASI.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: A study on prime arithmetic integer additive set-indexers of graphs