2016/04/11 by Meijie Ma, Ma, Meijie, Tingting Zhou +1
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Digital Image Processing Techniques #FOS: Mathematics #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.1604.02908
openalex publication_date 2016/04/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 are exceptions in each case.