A study on the modular sumset labeling of graphs

For a positive integer [Formula: see text], let [Formula: see text] be the set of all non-negative integers modulo [Formula: see text] and [Formula: see text] be its power set. A modular sumset valuation or a modular sumset labeling of a given graph [Formula: see text] is an injective function [Formula: see text] such that the induced function [Formula: see text] defined by [Formula: see text]. A modular sumset indexer of a graph [Formula: see text] is an injective modular sumset valued function [Formula: see text] such that the induced function [Formula: see text] is also injective. In this paper, some properties and characteristics of this type of modular sumset labeling of graphs are being studied.