Isomorphism Determination Methods for Complex Undirected Graphs
For the isomorphism determination problem of general complex undirected graphs,one determination condition based on the characteristic polynomial of the sum of adjacency matrices is proposed.For the isomorph-ism determination problem of complex undirected connected graphs,another determination condition based on the characteristic polynomials of the distance as well as the adjacency matrices is proposed,which can also be applied to each connected subgraph of the complex undirected unconnected graph,whose isomorphism determination problem can thus be solved.The above two are both necessary and sufficient conditions and still hold true when the com-plex undirected graphs degenerate into simple undirected graphs.
国家科技期刊平台
NSTL
万方数据
