查询词典 figurative graph

On the LAG basis, a kind of Block Adjacency Graph structure is developed here.

本文在LAG的基础上，发展出一种块邻接图BAG结构。

The adjacent strong edge chromatic number of join graph of star and path is obtained.

证明了圈Cm与圈C5n的笛卡尔积图的全色数和邻强边色数都为5。

In this paper,we proved that the total chromatic number and adjacent strong edge chromatic number of Cartesian product graph of cycle Cm and cycle C5n.

如果在一个图的正常边着色中，相邻两点关联的边集所着的颜色集合不同，则称此正常边着色为相邻强边着色。

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.

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

You can snipe the second and third union leaders from this position.

您可以鹬第二和第三工会领袖从这一立场出发。

Aiming at the currently shortage of XML streams quality detecting, this paper proposes a new forecasting method of XML streams quality by least squares support vector machines, which is used the method of XML keys' vector matrix as windows, and vector product wavelet transform to multilevel decompose and refactor the XML streams series, that can fulfill real-time checking demand of XML quality, and ensure constraint, consist- ency and integrality. For even more adapting net load, it proposes a control strategy by weight and adaptive adjustment to ensure XML streams quality.

针对当前XML数据流质量检测存在的不足，提出构建XML键的矢量矩阵作为窗口，利用矢量积小波变换多级分解与重构XML数据流，再结合最小二乘支持向量机对XML数据流质量进行预测的一种方法，满足XML数据流质量重构时实时检测的要求，保证XML数据的约束性、一致性与完整性；为了更好的适应网络负载，采取加权与自适应窗口调整等调度策略充分保证XML数据流的质量检测。