图的对称性研究是图论的重要课题。
The study of symmetric graphs is an active area in graph theory.
结合高级逻辑推导技术以及逻辑蕴含图的对称性推进简化过程。
Combination of advanced logic to simplify the process of derivation of technical advance.
当我们描绘数据集的分布(见于图5)与建模数据集时，我们不会找到对称性的证据。
As we have seen when we graphed the distribution of the dataset (see Figure five) and when we modeled the dataset we did not find evidence of symmetry.
对称性是图作为网络模型的重要性质。
Symmetry properties are of vital importance for graphs used as interconnection network models.
实验表明，反射全息图的衍射光谱呈现出明显的非对称性，并伴随着一系列次峰的出现。
The experiments has shown that the spectrum of reflection hologram presents obvious non-symmetry, and is accompanied with a series of sub-peaks.
并且对于具有某种对称性的图，我们给出了所谓的对称性策略。
For graphs with some symmetry, the so-called symmetry strategy is also given.
图1：轴位的平扫ct显示对称性的低密度影在颞枕叶脑白质区，需要注意的是病变累及胼胝体的压部。
Figure 1: Axial non contrast CT demonstrates symmetric low attenuation in the temporal-parietal white matter. Note involvement of the splenium of the corpus callosum (red arrows).
图的边可区别数是破坏图对称性的最小可区别的边标号数（颜色数）。
The edge distinguishing number of a graph G is the minimum number of the distinguishing labelings (colors) of the edges in G for which destroys the symmetries of G.
图的边可区别数是破坏图对称性的最小可区别的边标号数（颜色数）。
The edge distinguishing number of a graph G is the minimum number of the distinguishing labelings (colors) of the edges in G for which destroys the symmetries of G.
应用推荐