图论当中的术语,假设G=(V,E)和G1=(V1,E1)是两个图,如果存在一个双射m:V→V1,使得对所有的x,y∈V均有xy∈E等价于m(x)m(y)∈E1,则称G和G1是同构的,这样的一个映射m称之为一个同构,如果G=G1,则称他为一个自同构 在同构意义下封闭的图族叫做图性质
图同构 isomorphism of graphs ; graph isomorphism
同步定位与构图 simultaneous localization and mapping ; SLAM
自同构循环图 automorphism cyclic graph
精确图同构 exact graph isomorphism
图同构问题 graph isomorphism problem
图同构完备 Graph isomorphism complete
图的同构 Isomorphism of Graphs
图自同构群 automorphism group of a graph
3阶图自同构 Three gradation graph automorphism
前面的同构图例描述了一个简单的两个实例集群。
The previous homogeneous illustration depicts a simple two instance cluster.
通过逐一考查全体特征值,实现图同构的判定并确定同构图的顶点对应关系。
After all the eigenvalues have been considered, isomorphism will be determined and correspondence of vertices in isomorphic graphs can be ultimately identified.
应用推荐