A Study on the Modular Sumset Labeling of Graphs
Abstract
For a positive integer n, let be the set of all non-negative integers modulo n and () 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) () such that the induced function f+:E(G) () defined by f+ (uv) = f(u)+ f(v). A sumset indexer of a graph G is an injective sumset valued function f:V(G) () such that the induced function f+:E(G) () is also injective. In this paper, some properties and characteristics of this type of modular sumset labeling of graphs are being studied.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.