Disproof of a conjecture in graph reconstruction theory (Q1200285)

In his thesis B. D. Thatte (1990) conjectured that any finite sequence of finite connected graphs with the same number of vertices and edges can be uniquely reconstructed from its shuffled edge deck. The author shows that the conjecture is false. A small mistake is found on p. 367. In the sequence \({\mathcal G}_ 1=G_ 1,G_ 2,G_ 2,G_ 2,G_ 2\) the nontrivial component of \(G_ 1\) ought to be a star on five vertices.