1.
Discuss the isomorphisms of combinatorial maps and their recognition. Present two efficient algorithms for justifying the isomorphism of combinational maps.
讨论组合地图的同构、别,以及提供两个判别组合地图同构的有效算法.
2.
After all the eigenvalues have been considered, isomorphism will be determined and correspondence of vertices in isomorphic graphs can be ultimately identified.
通过逐一考查全体特征值，实现图同构的判定并确定同构图的顶点对应关系。
3.
The Structure and Drawing of the Subpicture of Different Structures from the n-Step Directionless Full Picture;
n阶无向完全图非同构生成子图的结构与作法
4.
The path layer matrix is closely related to graph isomorphism.
图的路径层矩阵与图的同构问题密切相关。
5.
Details of the intersections of various units are shown in both Fig.14a and Fig.14b.
图14A和图14B所示为不同构件结点处的具体细节。
6.
Explore the Arc Transitive of Kneser Graph and Automorphism Group of Switching Graph
Kneser图的弧传递性与开关图的自同构群探讨
7.
Several Properties of Kneser Graph and Its Automorphism Group;
Kneser图的若干性质及其自同构群
8.
On Isomorphisms of the Cayley Graphs of Small Valencies;
小度数Cayley图的同构问题研究
9.
Simultaneous Localization and Mapping for an AUV Based on EKF
基于EKF的AUV同时定位与构图方法研究
10.
The Calculation of the Non-isomorphism Graph on the Problem of Layout of Heat Exchanger Networks
换热网络布局问题中不同构图的计算
11.
Meaning Negotiating Mechanism in Collaborative Concept Mapping
协同概念构图系统中的意义协商机制
12.
Task scheduling algorithm for DAG graphs in homogenous computing environments
同构计算环境中DAG任务图的调度算法
13.
Construction of fine QTL mapping based on IBD-linkage desequilibrium analysis
同源相同性连锁不平衡作图构建高清晰度的QTL图谱
14.
This paper discusses the beauty of mathematical structure in the aspects of struture graphs, structure of groups and isomorphism, etc.
文章从结构图、结构、构等不同方面论述了数学结构的美。
15.
To show that two graphs are isomorphic one must indicate an isomorphism between them.
要证明两个图是同构的，就必须指出它们之间的一个同构。
16.
Graphs and their endomorphism semigroups are considered and the characterization of E-S unretractive graphs is given in this paper.
本文考虑了图及其自同态半群，给出了E—S不可收缩图的结构刻划。
17.
The Protein and DNA Fingerprinting of Different Maize Variety;
不同玉米品种蛋白质指纹图谱和DNA指纹图谱的构建
18.
Up to isomorphism, there is just one complete graph on vertices.
在同构意义下，几个顶点的完全图只有一个。