查询词典 separable graph

In the fifth chapter, we shall determine the adjacent vertex distinguishing incidence chromatic number of two types of join-graph.

在第五章中我们将确定两类联图的邻点可区别关联色数。

Dominating set is an important concept in graph theory, which is defined as an a vertexsubset such that every other vertex not in it must be adjacent to some vertex in this subset.

控制集是图论中的重要概念，它定义为图中的一个点集，使得图中其它任何一点都与该点集中的某点相邻。

Given an undirected graph,the vertex coloring problem is to assign a different color for vertex mutually adjacent.

图的顶点着色问题是指无向图中任意两个相邻顶点都分配到不同的颜色，这个问题是著名的NP 完全问题，没有非常有效的算法。

A set S of vertices in a graph G is a dominating set of G if each vertex of V-SV(G is adjacent to some vertex of S.

图G的点集S如果满足：V|G|-S中每个点相邻于S中的某个点，则称点集S是一个控制集。

In this dissertation, we shall study the incidence coloring ofθ- graph, then we shall define the concepts of the adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence chromatic number of graphs and determine the adjacent vertex distinguishing incidence chromatic number of some graphs.

本文研究了θ-图的关联着色，定义了图的邻点可区别关联着色及邻点可区别关联色数并确定了几类图的邻点可区别关联色数。

In the fourth chapter, we shall determine the adjacent vertex distinguishing incidence chromatic number of complete bipartite graphs, C_m,·F_n graphs and one type ofθ- graph.

在第四章中我们将确定完全二部图、C_m·F_n图及一类θ-图的邻点可区别关联色数。

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.

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

The father that if work,mad father, love annoys, disposition is too indrawn the be short ofing that the father of Mu Ne, resign oneself to adversity causes father easily to love is broken; Communicate time effectively between father and son, Mu Zizhi to be less than a hour on average to wait a moment every week, it is the cause that causes the child to become addiction.

如工作狂的父亲、爱愤怒的父亲、性格过于内向木讷、逆来顺受的父亲都易造成父爱的缺失；父子、母子之间的有效沟通时间每周平均小于一小时等等，都是造成孩子成瘾的原因。

These are vandal proof and they come with a locking mechanism.

这是野蛮的证据，他们来到了锁机制。