A study on integer additive set-graceful graphs
From MaRDI portal
Publication:786201
Abstract: A set-labeling of a graph is an injective function , where is a finite set and a set-indexer of is a set-labeling such that the induced function defined by for every is also injective. An integer additive set-labeling is an injective function , 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 defined by 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.
Recommendations
- A review on graceful and sequential integer additive set-labeled graphs
- A study on topological integer additive set-labeling of graphs
- A study on integer additive set-valuations of signed graphs
- Some new results on set-graceful and set-sequential graphs
- Further Results on Set Sequential and Set Graceful Graphs
Cited in
(11)- A review on graceful and sequential integer additive set-labeled graphs
- A note on the sparing number of generalised Petersen graphs
- Additively graceful graphs
- A study on topological integer additive set-labeling of graphs
- A study on the modular sumset labeling of graphs
- A study on integer additive set-valuations of signed graphs
- On certain types of product set-labeling of graphs
- scientific article; zbMATH DE number 2068142 (Why is no real title available?)
- A study on the product set-labeling of graphs
- On ideal sumset labelled graphs
- On disjunctive and conjunctive set-labelings of graphs
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)