Graphs with arbitrarily large adversary degree associated reconstruction number

A vertex deleted unlabeled subgraph of a graph is a card. A dacard specifies the degree of the deleted vertex along with the card. The adversary degree associated reconstruction number of a graph G, denoted is the minimum number k such that every collection of k dacards of G uniquely determines G. A strong double broom is the graph on at least 5 vertices obtained from a union of (at least two) internally vertex disjoint paths with same ends u and v by appending leaves at u and v. The strong double broom, obtained from a union of m internally vertex disjoint paths of order k with same ends u and v by appending n leaves at each u and v, is denoted by In this paper, we show that the drn of all strong double brooms is two and we determine for all For and usually and except For and usually except when and