The Reconstruction Problem of a Graph with Five Unlabeled Points

In this paper, we proved that a graph G of order p≥5 and with prescribed degree sequence d₁, d₂, …, d, is reconstructed from its arbitrary four principal subgraphs, if five points are not labeled and other points labeled in this graph G.We further proved that it is reconstructable from its arbitrary three principal subgraphs, if there are two or three principal subgraphs of unlabeled points in them.