度序列己给定且有三个点未标定的图的重构问题

The Reconstruction of A Graph with Prescribed Degree Sequence and Three Unlabeled Points

摘要: 本文证明了:度序列d_i(1≤i≤p)已给定的p阶图G,如果其中3个点未标定,其余p-3个顶点已标定,则图G可由任意2个主子图重构。

Abstract: In this paper,it is proved that a graph G of order p≥3 with presc-ribed degree sequenced_i(1≤i≤p)is reconstructable any two principal subgraphs if three points are not labeled and the other points are labeled in this graph G.