A study on the modular sumset labeling of graphs

DOI10.1142/S1793830917500392zbMATH Open1373.05165arXiv1508.00319MaRDI QIDQ5367533FDOQ5367533

N. K. Sudev

Publication date: 20 October 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Abstract: For a positive integer $n$, let $mZ$ be the set of all non-negative integers modulo $n$ and $sP(mZ)$ be its power set. A modular sumset valuation or a modular sumset labeling of a given graph $G$ is an injective function $f:V(G)osP(mZ)$ such that the induced function $f^{+}:E(G)osP(mZ)$ defined by $f^{+}(uv)=f(u)+f(v)$. A sumset indexer of a graph $G$ is an injective sumset valued function $f:V(G)osP(mZ)$ such that the induced function $f^{+}:E(G)osP(mZ)$ is also injective. In this paper, some properties and characteristics of this type of modular sumset labeling of graphs are being studied.

Full work available at URL: https://arxiv.org/abs/1508.00319

zbMATH Keywords

exquisite modular sumset graphsmaximal modular sumset graphsmodular sumset graphsmodular sumset number of a graphstrong modular sumset graphsweak modular sumset graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Additive bases, including sumsets (11B13)

Cites Work

• Graph Classes: A Survey
• A dynamic survey of graph labeling
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

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)