{"paper":{"title":"The Strongly Antimagic labelings of Double Spiders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei-Huang Chang, Pinhui Chin, Wei-Tian Li, Zhishi Pan","submitted_at":"2017-12-27T02:05:47Z","abstract_excerpt":"A graph $G=(V,E)$ is strongly antimagic, if there is a bijective mapping $f: E \\to \\{1,2,\\ldots,|E|\\}$ such that for any two vertices $u\\neq v$, not only $\\sum_{e \\in E(u)}f(e) \\ne \\sum_{e\\in E(v)}f(e)$ and also $\\sum_{e \\in E(u)}f(e) < \\sum_{e\\in E(v)}f(e)$ whenever $\\deg(u)< \\deg(v) $, where $E(u)$ is the set of edges incident to $u$. In this paper, we prove that double spiders, the trees contains exactly two vertices of degree at least 3, are strongly antimagic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09477","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"}