图同构的一个充分必要条件  

Necessary and sufficient condition of graphic isomorphism

作　　者：侯爱民[1] 

机构地区：[1]东莞理工学院计算机科学与技术系,广东东莞523808

出　　处：《计算机工程与应用》2009年第30期57-61,共5页Computer Engineering and Applications

摘　　要：图同构的判定性问题是图论理论中的一个难问题,至今没有得到彻底解决。Ulam曾经提出过一个判定图同构的猜想,也称为图的重构猜想。提出了一个新的判定图同构的充分必要条件,即在子图同构的前提下,根据新增顶点及相应关联边的关系,判断母图同构的充分必要条件。基于具有同构关系的对应点无限衍生技术,采用数学归纳法证明了这个充分必要条件的成立。How to determine the isomorphism of graphs is a difficult problem of graph theory,which is not completely solved so far.S.M.Ulam has proposed a conjecture concerning graphic isomorphism,named graph reconstruction.In this paper a new necessary and sufficient condition of graphic isomorphism is proved which is stated as following： two graphs are isomorphic if and only if their subgraphs are isomorphic and the new vertices as well as their adjancy edges are corresponding with the property of isomorphism.Based on the technique for unlimitedly generating the corresponding pairs of vertices,this condition is proved with the method of mathematical induction.

关 键 词：子图同构 母图同构 对应点无限衍生技术 

分 类 号：O157.5[理学—数学]