{"paper":{"title":"On Local Antimagic Vertex Coloring for Corona Products of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"K. Premalatha, S. Arumugam, Tao-Ming Wang, Yi-Chun Lee","submitted_at":"2018-08-15T03:23:53Z","abstract_excerpt":"Let $G = (V, E)$ be a finite simple undirected graph without $K_2$ components. A bijection $f : E \\rightarrow \\{1, 2,\\cdots, |E|\\}$ is called a {\\bf local antimagic labeling} if for any two adjacent vertices $u$ and $v$, they have different vertex sums, i.e. $w(u) \\neq w(v)$, where the vertex sum $w(u) = \\sum_{e \\in E(u)} f(e)$, and $E(u)$ is the set of edges incident to $u$. Thus any local antimagic labeling induces a proper vertex coloring of $G$ where the vertex $v$ is assigned the color(vertex sum) $w(v)$. The {\\bf local antimagic chromatic number} $\\chi_{la}(G)$ is the minimum number of c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04956","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"}