论文信息 - Towards size reconstruction from fewer cards

Towards size reconstruction from fewer cards

It is proved that if two graphs of order n have n - p cards (vertex-deleted subgraphs) in common, where p ? 3 , and n is large enough compared with p , then the numbers of edges in the two graphs differ by at most p - 2 . This is a modest but nontrivial improvement of the easy result that these numbers differ by at most p .

Douglas R. Woodall

[1] Wendy Myrvold,et al. A survey of some open questions in reconstruction numbers , 2010, Ars Comb..

[2] Robert L. Hemminger,et al. Graph reconstruction - a survey , 1977, J. Graph Theory.

[3] Wendy J. Myrvold. The degree sequence is reconstructible from n-1 cards , 1992, Discret. Math..

[4] S. Ramachandran,et al. Pairs of graphs having n-2 cards in common , 2013, Ars Comb..