Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph

An ecard of a graph G is a subgraph formed by deleting an edge. A da-ecard specifies the degreeof the deleted edge along with the ecard. The degree associated edge reconstruction numberof a graph G; dern(G); is the minimum number of da-ecards that uniquely determines G: Theadversary degree associated edge reconstruction number of a graph G; adern(G); is the minimumnumber k such that every collection of k da-ecards of G uniquely determines G: The maximalsubgraph without end vertices of a graph G which is not a tree is the pruned graph of G: It isshown that dern of complete multipartite graphs and some connected graphs with regular prunedgraph is 1 or 2: We also determine dern and adern of corona product of standard graphs.