A study on integer additive set-graceful graphs

From MaRDI portal
Publication:786201




Abstract: A set-labeling of a graph G is an injective function f:V(G)omathcalP(X), where X is a finite set and a set-indexer of G is a set-labeling such that the induced function foplus:E(G)ightarrowmathcalP(X)emptyset defined by foplus(uv)=f(u)oplusf(v) for every uvinE(G) is also injective. An integer additive set-labeling is an injective function f:V(G)ightarrowmathcalP(mathbbN0), mathbbN0 is the set of all non-negative integers and an integer additive set-indexer is an integer additive set-labeling such that the induced function f+:E(G)ightarrowmathcalP(mathbbN0) defined by f+(uv)=f(u)+f(v) is also injective. In this paper, we extend the concepts of set-graceful labeling to integer additive set-labelings of graphs and provide some results on them.









This page was built for publication: A study on integer additive set-graceful graphs

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