Some new results on strong integer additive set-indexers of graphs

From MaRDI portal




Abstract: Let mathbbN0 be the set of all non-negative integers. An integer additive set-indexer of a graph G is an injective function f:V(G)o2mathbbN0 such that the induced function gf:E(G)ightarrow2mathbbN0 defined by f+(uv)=f(u)+f(v) is also injective. An IASI is said to be {em k-uniform} if |f+(e)|=k for all einE(G). In this paper, we introduce the notions of strong integer additive set-indexers and initiate a study of the graphs which admit strong integer additive set-indexers.











This page was built for publication: Some new results on strong integer additive set-indexers of graphs

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