On weakly uniform integer additive set-indexers of graphs
From MaRDI portal
Abstract: Acharya introduced the notion of set-valuations of graphs as a set analogue of the number valuations of graphs. Also we have the notion of set-indexers, integer additive set-indexers and k-uniform integer additive set-indexers. In this paper, we initiate a study of the graphs which admit k-uniform integer additive set-indexers as a generalisation to the earlier studies of 1-uniform and 2-uniform integer additive set-indexers. We introduce the notion of weakly uniform integer additive set-indexers and arbitrarily uniform integer additive set-indexers based on the cardinality of the labeling sets and provide some useful results on these types of set-indexers.
Recommendations
Cited in
(17)- The sparing number of certain graph powers
- A characterization for topologically integer additive set-indexer of graphs
- A characterisation of weak integer additive set-indexers of graphs
- On certain arithmetic integer additive set-indexers of graphs
- Weak integer additive set-labeled graphs: a creative review
- A study on prime arithmetic integer additive set-indexers of graphs
- A review on graceful and sequential integer additive set-labeled graphs
- A study on topological integer additive set-labeling of graphs
- On ideal sumset labelled graphs
- On Weak Integer Additive Set-Indexers of Certain Graph Classes
- scientific article; zbMATH DE number 7268059 (Why is no real title available?)
- A study on the product set-labeling of graphs
- Some new results on strong integer additive set-indexers of graphs
- A study on the modular sumset labeling of graphs
- Switched signed graphs of integer additive set-valued signed graphs
- Nourishing number of some associated graphs
- Topological integer additive set-sequential graphs
This page was built for publication: On weakly uniform 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 Q3191685)