摘要
对于非正则图的同构问题,给出了新的判定方法,并且对该方法的复杂度进行了简单的分析,最后用实例证明新方法比以往的方法简单方便。
A new decision method for non regular graph isomorphism problem is given in this article which also analysis its complexity. Finally, an example is used to prove this methed is simple and convenient than before.
出处
《西昌学院学报（自然科学版）》
2015年第1期25-27,共3页
Journal of Xichang University(Natural Science Edition)
关键词
图同构
邻接矩阵
关联度
算法
graph isomorphism
adjacency matrix
correlation
algorithm
