A study on the modular sumset labeling of graphs
DOI10.1142/S1793830917500392zbMATH Open1373.05165arXiv1508.00319MaRDI QIDQ5367533FDOQ5367533
Authors: N. K. Sudev
Publication date: 20 October 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.00319
Recommendations
exquisite modular sumset graphsmaximal modular sumset graphsmodular sumset graphsmodular sumset number of a graphstrong modular sumset graphsweak modular sumset graphs
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Additive bases, including sumsets (11B13)
Cites Work
- Graph theory
- Graph Classes: A Survey
- A dynamic survey of graph labeling
- Title not available (Why is that?)
- Title not available (Why is that?)
- On weakly uniform integer additive set-indexers of graphs
- Title not available (Why is that?)
- Some new results on strong integer additive set-indexers of graphs
- Integer additive set-indexers of a graph: sum square graphs
- The Shields-Harary indices of vulnerability of a graph
- Title not available (Why is that?)
Cited In (7)
- Structural properties of some families of modular multiplicative divisor graphs
- Title not available (Why is that?)
- On ideal sumset labelled graphs
- On disjunctive and conjunctive set-labelings of graphs
- Strong modular sumset number of graphs when vertices are assigned with sets of cardinality two
- Title not available (Why is that?)
- A study on the product set-labeling 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)