查询词典 edges

Let G = V(G,E be a simple graph with |V| vertices and |E| edges. Let |V|= p,|E|= q, if there exists f: V →{1,2,...,p} be an injective mapping, and define an inducedfunction f":E→{1,2,...,q} by setting f"=|f-f| for all∈E. If f maps E onto {1,2,...,q}, then f is said to be a Skolem-graceful labeling of G, the graph G is said to be a Skolem-graceful graph.

对一个给定的简单图G=V(G，E，|V|和|E|分别是图G的顶点数和边数，令|V|=p，|E|=q，如果存在一个一一映射f：V→{1，2，…，p}，使得对所有边∈E，由f′=|f-f|所导出的映射函数f′：E→{1，2，…，q}是一一对应关系，则称f是图G的一个Skolem优美标号，图G被称为Skolem优美图。

The edges of the motor court have a more solid course of pavers to define the edge and an interior band or textured pavers with a color change as a visual cue to flag the edge of the pavement.

电机的法庭的边缘有一个更加坚实的铺设过程中确定的边缘和室内乐队或作为可视的提示，国旗在行人边缘纹理颜色的变化铺路。

To find the correct edges of an image and interpolate with the edge, an improved edge adaptive image-scaling algorithm was proposed.

为了找到正确的图像边沿去进行插值，提出了一种改进的边沿自适应图像缩放算法。

It just shows a graph on the screen with intersecting edges.

这只是显示图形屏幕上的交叉边缘。

Corolla tube shorter than sepals; calyx with basal glands only inside sepal edges; leaves without a strong intramarginal vein.

花冠筒短于萼片；只在萼片边缘里面的花萼具基部腺体；叶没有一强壮的边脉。

In the matching stage, the angle of feature vectors is used as the similarity measure in the high dimensional space directly. This similarity measure is invariant to the linear transformation of feature vectors. Compared with SIFT and normalized correlation, the proposed method needs no primary features such as edges, corners, gradient or shapes which are very unstable in low contrast and low NSR images.

在匹配过程中，以向量之间夹角的大小作为相似度度量，直接利用图像的灰度信息在高维向量空间中考虑图像之间的相似度，克服了在低照度、低信噪比的图像中求边缘、角点、梯度和形状等特征的困难，不受向量模大小以及向量平移的影响，即相似度的计算是线性光照不变的。

Organoleptic fining to soften rough edges is usually done with egg whites, isinglass, gelatine, or casein.

感官罚软化粗糙边缘通常做蛋白、明胶、明胶或干酪素。

And in the same paper, Rose proved that if G is a graph with q edges, then graph K_{2q+1} can be partitioned into 2q+1 graphs which are isomorphic to graph G.

Rose在文献[2]中指出了Ringel猜想的证明与优美树猜想有关，并给出了一般的结论：设G是一个q条边的优美图，那么K_2q+1可分解出2q+1个图都同构于G。

In this paper a new necessary and sufficient condition of graphic isomorphism is proved which is stated as following: two graphs are isomorphic if and only if their subgraphs are isomorphic and the new vertices as well as their adjancy edges are corresponding with the property of isomorphism.

提出了一个新的判定图同构的充分必要条件，即在子图同构的前提下，根据新增顶点及相应关联边的关系，判断母图同构的充分必要条件。

It fit, but not perfectly, as there were some jagged edges.

它合适的，但是不是完美的，因为边缘已经参差不齐了。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。