{"paper":{"title":"Some New Results on Strong Integer Additive Set-Indexers of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"K. A. Germina, N. K. Sudev","submitted_at":"2013-10-23T15:57:41Z","abstract_excerpt":"Let $\\mathbb{N}_0$ be the set of all non-negative integers. An integer additive set-indexer of a graph $G$ is an injective function $f:V(G)\\to 2^{\\mathbb{N}_0}$ such that the induced function $g_f:E(G) \\rightarrow 2^{\\mathbb{N}_0}$ defined by $f^+(uv) = f(u)+ f(v)$ is also injective. An IASI is said to be {\\em $k$-uniform} if $|f^+(e)| = k$ for all $e\\in E(G)$. In this paper, we introduce the notions of strong integer additive set-indexers and initiate a study of the graphs which admit strong integer additive set-indexers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6266","kind":"arxiv","version":3},"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"}