English

A Study on the Modular Sumset Labeling of Graphs

General Mathematics 2017-02-01 v2

Abstract

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

Cite

@article{arxiv.1508.00319,
  title  = {A Study on the Modular Sumset Labeling of Graphs},
  author = {Sudev Naduvath},
  journal= {arXiv preprint arXiv:1508.00319},
  year   = {2017}
}

Comments

16 pages, 7 figures, communicated

R2 v1 2026-06-22T10:24:42.362Z