{"paper":{"title":"A Study on the Modular Sumset Labeling of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Sudev Naduvath","submitted_at":"2015-08-03T06:14:08Z","abstract_excerpt":"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) \\to \\sP(\\mZ)$ such that the induced function $f^+:E(G) \\to \\sP(\\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) \\to \\sP(\\mZ)$ such that the induced function $f^+:E(G) \\to \\sP(\\mZ)$ is also injective. In this paper, some properties and characteristics of this type of modular sumset labeling of gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00319","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}