Some new results on strong integer additive set-indexers of graphs
Abstract
Let ℕ0 be the set of all non-negative integers. An integer additive set-indexer (IASI) of a graph G is an injective function f : V(G) → 2ℕ0 such that the induced function gf : E(G) → 2ℕ0 defined by f+(uv) = f(u) + f(v) is also injective. An IASI is said to be k-uniform if |f+(e)| = k for all e ∈ E(G). In this paper, we introduce the notions of strong IASIs and initiate a study of the graphs which admit strong IASIs.
Remember to check out the Most Cited Articles! |
---|
Be inspired by these NEW Mathematics books for inspirations & latest information in your research area! |