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. https://yeswellneses.shop/product-category/cereal/