查询词典 fuzzy graph

Let G be a double-outer plane graph, V, E, F be the set of points, edge and face, a plane graph G is k-total colorable, if the elements of V E can be colored with K-colors, any two distinct adjacent or incident elements receive different colors.

设G是一个双外平面图，V，E，F分别为双外平面图G的点集，边集和面集。G的全色数X是使得V∪E中的任意两个相邻或相关联的元素间均染不同颜色的最少颜色数。

The graph coloring problem is one of important branchs of graph theory.

图的着色问题是图论中的一个重要研究领域。

And based on traditional graph coloring register allocation,a new algorithm to construct unified and simplified interference graph utilizing complementary predicate is presented,which can reduce spill code.

最后在YHFT-DSP/700芯片的编译器上对所提优化方法的有效性进行了验证。1引言指令级并行(ILP，Instruction Level Parallelism)一直以来都是编译领域的一个研究热点。

Furthermore, the complexity between the relationships of synchronizability and network structural parameters are discussed via two simple graphs, and the effects of complementary graph, edge-addition and graph operation on the synchronization of complex networks are elaborated.

其次以两个简单图指出同步能力与网络结构参数的关系复杂，并给出补图与加边对同步研究的意义，然后给出图运算在复杂网络同步中的作用。

In this paper the level of elementary graphs is explored, and the D^2 of any non-bipartite elementary graph is proved to be a complete graph.

本文研究了基本图的水平，证明了对于任何非二部的基本图，它的D^2是一个完全图。

And two important growing ways: star-like graph growth and complete graph growth.

增长和择优机制是无标度网络中两个最重要的演化机制，已发现比较重要的择优机制有度择优和秩次择优，比较重要的增长方式有星形图增长和完全图增长。

For example, say we wish to know if two vertices in a graph of n vertices are in the same connected component of the graph.

举个范例，我们希望知道一个有 n 个顶点的图形中的两个顶点是否位於图中同一个连接元件。

A graph in which any two vertices are connected by a path is called connected graph.

一个图中如果任意两个顶点都有一条路相连，则称之为连通图。

If any two nodes in a graph can be connected by a path along edges ,the graph is said to be connected.

如果图中任意两个结点间都能够用一条路径沿着边线连接起来，那么该图则被称为连通的。

In general,given two vertices V and W in a graph,it is not always possible to find a path connecting them;such a path will exist only when the graph is 'in one piece'.

D8 |一般而言，给定图的两个顶点V和W并非总能找到连接它们的路；只有当图是"在一块中"时，这样的路才存在。

The second is to cut a mere 100 calories from your diet , which is the equivalent of a tablespoon of butter.

第二个就是从你的饮食中减少一百卡路里，只是相当于一大汤匙的黄油。

This is where the Rorschach test comes in.

现在，罗氏测试就出现了。