Topological integer additive set-sequential graphs

Abstract: Let

m a t h b b N_{0}

denote the set of all non-negative integers and

X

be any non-empty subset of

m a t h b b N_{0}

. Denote the power set of

X

by

m a t h c a l P (X)

. An integer additive set-labeling (IASL) of a graph

G

is an injective set-valued function

f : V (G) o m a t h c a l P (X)

such that the induced function

f^{+} : E (G) o m a t h c a l P (X)

is defined by

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

, where

f (u) + f (v)

is the sumset of

f (u)

and

f (v)

. If the associated set-valued edge function

f^{+}

is also injective, then such an IASL is called an integer additive set-indexer (IASI). An IASL

f

is said to be a topological IASL (TIASL) if

f (V (G)) c u p e m p t y s e t

is a topology of the ground set

X

. An IASL is said to be an integer additive set-sequential labeling (IASSL) if

f (V (G)) c u p f^{+} (E (G)) = m a t h c a l P (X) - e m p t y s e t

. An IASL of a given graph

G

is said to be a topological integer additive set-sequential labeling of

G

, if it is a topological integer additive set-labeling as well as an integer additive set-sequential labeling of

G

. In this paper, we study the conditions required for a graph

G

to admit this type of IASL and propose some important characteristics of the graphs which admit this type of IASLs.

Recommendations

Cites work

Cited in

(13)

This page was built for publication: Topological integer additive set-sequential graphs