{"paper":{"title":"Degree-associated edge-reconstruction numbers of double-brooms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Meijie Ma, Tingting Zhou","submitted_at":"2016-04-11T12:11:04Z","abstract_excerpt":"An edge-deleted subgraph of a graph $G$ is an {\\it edge-card}. A {\\it decard} consists of an edge-card and the degree of the missing edge. The {\\it degree-associated edge-reconstruction number} of a graph $G$, denoted $\\dern(G)$, is the minimum number of decards that suffice to reconstruct $G$. The {\\it adversary degree-associated edge-reconstruction number} $\\adern(G)$ is the least $k$ such that every set of $k$ decards determines $G$. We determine these two parameters for all double-brooms. The answer is usually $1$ for $\\dern(G)$, and $2$ for $\\adern(G)$ when $G$ is double-broom. But there "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02908","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"}