乌拉姆猜想的证明

A proof of ulam conjecture

S.M.Ulam猜想任何一个 n阶图 (n>2 )都可重构。利用图的邻接矩阵的初等变换的方法对于无标号有限图给出了证明 。

S.M.Ulam conjectures that every graph of order n (n>2) is reconstructed.In this paper,we proved that the limited and unlabelled graph is reconstructed with the elementary transformation of adjacency matrix,and an algebra method is obtained to check the isomorphic about two graphs.