Reconstruction of the set of branches of a graph

It is proved that the set of branches of a graphG is reconstructible except in a very special case. More precisely the set of branches of a graphG is reconstructible unless all the following hold: (1) the pruned center ofG is a vertex or an edge, (2)G has exactly two branches, (3) one branch contains all the vertices of degree one ofG and the other branch contains exactly one end-block. This is the best possible result in the sense that in the special excluded case, the reconstruction of the set of branches is equivalent to the reconstruction of the graph itself.