作　　者： ;

机构地区： 重庆三峡学院计算机科学与工程学院

出　　处： 《集成技术》 2013年第6期22-26,共5页

摘　　要： 图论中的图同构判定问题仍是一个未能圆满解决的重要问题。文章从图的邻接矩阵的行、列置换出发,得到能加快判定两个图是否同构的一系列性质。在几个性质基础上,提出了一种判定两个图是否同构的搜索算法。接着给出两个实例对该算法加以说明和演示,以便更好地理解这些性质和算法。最后对文章作简要的总结并指出进一步的研究方向。 The graph isomorph judgement problem in graph theory is yet to be solved. A series of properties for the quicker judgement on whether two graphs are isomorphic were obtained through the permutation of rows and columns of adjacent matrix of graphs. A search algorithm on graph isomorph judgement was proposed on the basis of several properties. Then two examples were presented to explain and demonstrate the algorithm for better understanding of these properties and the algorithm. Finally a brief conclusion and the further research direction were presented.

关 键 词： 图 同构 邻接矩阵 同构置换

领　　域： [理学] [理学] [自动化与计算机技术]