论文信息 - N-reconstructibility of non-reconstructible digraphs

N-reconstructibility of non-reconstructible digraphs

In this paper we prove that all the non-reconstructible digraphs constructed by Stockmeyer in [3] are reconstructible from their point-deleted subdigraphs with the additional knowledge of the degree pair of the deleted point for each point-deleted subdigraph.

S. Ramachandran

[1] S. Ramachandran. On a new digraph reconstruction conjecture , 1981, J. Comb. Theory, Ser. B.

[2] Claude Berge,et al. The theory of graphs and its applications , 1962 .

[3] Paul K. Stockmeyer. A census of non-reconstructable digraphs, I: Six related families , 1981, J. Comb. Theory, Ser. B.