摘要
通过对两个图邻接矩阵的特征值以及特征向量分析,利用对角化过程中的正交特征向量矩阵的特殊性质,得到了一种新的无向图同构的充要条件,并且由此条件得到同构图之间存在的关系,从而使得判定图的同构更加方便,尤其是在需要找出变换矩阵、判定同谱图时非常有效.
Based on the analysis of the eigenvalues and eigenvectors of the two graphs＇ adjacency matrix and the special property of the orthogonal eigenvector matrix in diagonalization process,this paper gave a novel necessary and sufficient condition for undigraph isomorphism and the relationship between isomorphic graphs,which provides much convenience for the judgment of graphic isomorphism,especially in finding the permutation matrix and judging cospectral graphs.
出处
《佳木斯大学学报（自然科学版）》
CAS
2015年第2期309-313,共5页
Journal of Jiamusi University：Natural Science Edition
关键词
同构
特征值
邻接矩阵
正交化
特征向量
isomorphism
eigenvalue
adjacency matrix
orthogonalization
eigenvector
