A study on the modular sumset labeling of graphs
From MaRDI portal
Publication:5367533
Abstract: For a positive integer , let be the set of all non-negative integers modulo and be its power set. A modular sumset valuation or a modular sumset labeling of a given graph is an injective function such that the induced function defined by . A sumset indexer of a graph is an injective sumset valued function such that the induced function is also injective. In this paper, some properties and characteristics of this type of modular sumset labeling of graphs are being studied.
Recommendations
Cites work
- scientific article; zbMATH DE number 5509797 (Why is no real title available?)
- scientific article; zbMATH DE number 3963158 (Why is no real title available?)
- scientific article; zbMATH DE number 2068142 (Why is no real title available?)
- scientific article; zbMATH DE number 933467 (Why is no real title available?)
- A dynamic survey of graph labeling
- Graph Classes: A Survey
- Graph theory
- Integer additive set-indexers of a graph: sum square graphs
- On weakly uniform integer additive set-indexers of graphs
- Some new results on strong integer additive set-indexers of graphs
- The Shields-Harary indices of vulnerability of a graph
Cited in
(7)- scientific article; zbMATH DE number 1355291 (Why is no real title available?)
- A study on the product set-labeling of graphs
- Structural properties of some families of modular multiplicative divisor graphs
- On ideal sumset labelled graphs
- Strong modular sumset number of graphs when vertices are assigned with sets of cardinality two
- scientific article; zbMATH DE number 5360708 (Why is no real title available?)
- On disjunctive and conjunctive set-labelings of graphs
This page was built for publication: A study on the modular sumset labeling of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367533)