图边重构性的一个定理的简短证明

A Short hoof for the Theorem onEdge Reconstruction of Graph

给出了若图Ｇ没有次为ｄ的顶点使ｄ—１和ｄ十１都是Ｇ的顶点次，则Ｇ是边可重构的这一命题的简短证明．

If G has no vertex of degree dsuch that bath d- 1 and d+1 are also degrees in G,then G is edge reconstructible. This peper gives a short Proof for this theorem.