摘要
本文给出了两个图同构的一个必要条件,从而提出了判定两图不同构的一个方法;文中还利用重构图中一个已有的结论,给出了两个图同构的一个充分必要条件,从而为判定两图同构提供了一个新的方法。
This paper gives a necessary condition for isomorphism of two graphs,and puts forward a new method about judging non-isomorphism of them.Besides,it presents a necessary and sufficient condition for isomorphism of two graphs by using a conclusion known in the graph,and a new method for judging isomorphism of two graphs.
关键词
同构
重构
主子图
子图
相容组
isomorphism
reconstruction
chief subgraph
subgraph
group of compatibility