A characterisation of weak integer additive set-indexers of graphs

Publication date 20 February 2017

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

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

such that the induced function

g_{f} : E (G) i g h t a r r o w 2^{m a t h b b N_{0}}

defined by

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

is also injective. An integer additive set-indexer is said to be

k

-uniform if

| g_{f} (e) | = k

for all

e i n E (G)

. An integer additive set-indexer

f

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

| g_{f} (u v) | = m a x (| f (u) |, | f (v) |)

for all

u, v i n V (G)

. In this paper, we study the characteristics of certain graphs and graph classes which admit weak integer additive set-indexers.

Recommendations

Cited in

(13)

This page was built for publication: A characterisation of weak integer additive set-indexers of graphs