Degree-associated reconstruction number of graphs

A card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjecture states that each graph with at least three vertices is determined by its multiset of cards. A dacard specifies the degree of the deleted vertex along with the card. The degree-associated reconstruction number drn(G) is the minimum number of dacards that determine G. We show that drn(G) = 2 for almost all graphs and deter

• Type: Journal
• Year: 2010
• Where: DM
• Authors: Michael D. Barrus, Douglas B. West
• Keywords: Card, Degree-associated Reconstruction Number, DM 2010, Reconstruction Conjecture