查询词典 graph

A pebbling move on a graph G consists of taking two pebbles off from a vertex and placing one pebble on an adjacent vertex.

在图上进行小石块的移动的步骤为从一个点上取走两个小石块，并在它的某个邻点上放一个小石块。

The "Prufer" code of such a tree is built as follows: the leaf (a vertex that is incident to only one edge) with the minimal number is taken. This leaf, together with its incident edge is removed from the graph, while the number of the vertex that was adjacent to the leaf is written down.

从题目描述我们可以知道，对于一棵树，每次都找到编号最小的叶子结点，然后输出它的双亲结点的编号作为 Prufer Code，同时删除这个最小的叶子结点为下一次输出 Prufer Code 做准备。

In this master thesis, we mainly discuss the adjacent vertex- distinguishing total chromatic numbers of some special graphs and prove that Zhang"s conjecture holds for these graphs. Then we get the adjacent vertex-distinguishing total chromatic numbers of the Halin Graphs. Moreover, we investigate the Generalized Petersen Graphs, prove that some classes of positive integers can"t structure the Generalized Petersen Graphs and get the result that the adjacent vertex-distinguishing total chromatic number is 5. Finally, based on the number and the parity of circles contained by the graph, we get the adjacent vertex-distinguishing total chromatic number of two classes of graphs.

本学位论文首先主要针对几个特殊图类讨论其邻点可区别全色数，验证了其满足图的邻点可区别全色数的猜想；再证明了非轮的Halin图的邻点可区别全色数；接着研究的是广义Petersen图，讨论了不能构成广义Petersen图的几类正整数，并证明了该图的邻点可区别全色数等于5；最后，根据图所含圈的个数及其奇偶性得到了两类图的邻点可区别全色数。

A kind of on-line gradient learning algorithms based on signal flow graphs isproposed for neural networks on-line training. The signal flow graph and adjoint one of aneural network are used to compute the its gradients.

对于动态神经网络在线学习而言，该算法避免了传统梯度计算中复杂的链式求导过程，利用神经网络的信号流图及其线性的伴随流图，可以直接计算任何变量的梯度信息。

Some of the classical watch models of Wenger includes Aerograph day date, Alpine 2-eye day date, Alpine Swiss Rallye limited edition, aqua graph deep diver for male and Commando chrono, escort, and Alpenrose for females.

一些经典的观赏模式温格包括喷漆器日日期，高寒2眼日日期，瑞士阿尔卑斯山拉力赛的限量版， Aqua卫星图深海潜水员为男性和突击队时辰，护送，并Alpenrose女性。

It is with VisualC++ compile platform, apply library of OpenGL graph function to build a kind three-dimensional model of yuan of afterbirth automatic machine.

以VisualC++为编译平台，运用OpenGL图形函数库建立一种三维元胞自动机模型。

Exemple 1(Sichuan coils the 14th problem) show 1 times like the graph, the one aspect of the matter of large wall container is inserted into an acute thermometer and an air tube through glue stuff, another end has a portable glue that gets stuck with checkpost to fill in.

例1(四川卷第14题)如图1所示，厚壁容器的一端通过胶塞插进一支灵敏温度计和一根气针，另一端有个用卡子卡住的可移动胶塞。

Linear Algebra is mainly a subject which studies the linear structure of finite dimensional linear space and its linear transformation while linear concept is in itself from the old Euclid Geometry. The concept of "Linear Space" is a kind of algebraic abstract. In many fields of modern engineering project and technology, because of the influence of computer and graph showing, the algebraic disposal of geometric questions, the visual disposal of algebraic questions, algebra and geometry are tightly combined.

线性代数主要是研究有限维线性空间及其线性变换这一代数结构的学科，而线性概念究其根源则是来自古老的Euclid几何，线性空间概念是几何空间的一种代数抽象，在现代工程技术的许多领域里，由于计算机及图形显示的强大威力，几何问题的代数化处理，代数问题的可视化处理，把代数与几何更加紧密地结合在一起。

The purpose of this thesis is to collect the known results in graph theory with algebraic techniques involved.

这篇论文的目的主要是收集了已知的图论上使用的代数方法。

In order to overcome this difficulty,a clustering algorithm based on dynamic division of connected graph is proposed.

当前大部分的聚类算法都难以处理任意形状和大小、存在孤立点和噪音以及密度多变的簇，为此，文中提出了一种基于连通图动态分裂的聚类算法。

Liapunov—Schmidt method is one of the most important method in the bifurcation theory.

Liapunov—Schmidt方法是分叉理论的最重要方法之一。

Be courteous -- even when people are most discourteous to you .

要有礼貌──即使当別人对你最不礼貌的时候。