A note on the adversary degree associated reconstruction number of graphs (Q2249937): Difference between revisions

Summary: A vertex-deleted subgraph of a graph \(G\) is called a card of \(G\). A card of \(G\) with which the degree of the deleted vertex is also given is called a degree associated card (or dacard) of \(G\). The degree associated reconstruction number \(\mathrm{drn}(G)\) of a graph \(G\) is the size of the smallest collection of dacards of \(G\) that uniquely determines \(G\). The adversary degree associated reconstruction number of a graph \(G\), \(\mathrm{adrn}(G\)), is the minimum number \(G\) such that every collection of \(k\) dacards of \(G\) that uniquely determines \(G\). In this paper, we show that adrn of wheels and complete bipartite graphs on at least 4 vertices is 2 or 3.