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 cubs foam finger 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