{"paper":{"title":"On the Sparing Number of the Edge-Corona of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"K. A. Germina, K. P. Chithra, N. K. Sudev","submitted_at":"2015-05-19T02:37:25Z","abstract_excerpt":"Let $\\mathbb{N}_0$ be the set of all non-negative integers and $\\mathcal{P}(\\mathbb{N}_0)$ be its the power set. An integer additive set-indexer (IASI) of a graph $G$ is an injective function $f:V(G)\\to \\mathcal{P}(\\mathbb{N}_0)$ such that the induced function $f^+:E(G) \\to \\mathcal{P}(\\mathbb{N}_0)$ defined by $f^+ (uv) = f(u)+ f(v)$ is also injective, where $f(u)+f(v)$ is the sum set of $f(u)$ and $f(v)$. An integer additive set-indexer $f$ is said to be a weak integer additive set-indexer (weak IASI) if $|f^+(uv)|=\\max(|f(u)|,|f(v)|)~\\forall ~ uv\\in E(G)$. The minimum number of singleton se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04854","kind":"arxiv","version":1},"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"}