total graph的例句大全

on the strong perfectness of total graph

关于全图的强完美性

In this paper the total chromatic conjecture is verified to be true for complete 4-partite graph.

本文对所有4部完全图证实了全着色猜想。

In this paper, a generalized algorithm is provided to extend a 4-regular graph to another 4-regular graph through base rectilinear extension, from which the base rectilinear extension with the minimum total number of bends of the graph is naturally obtained on the basis of the original one.

本文通过基纵横扩张，提供了从一个4-正则图扩充为另一个4-正则图的方式，使得从原图的最小折数基纵横扩张自然导出扩充图的最小折数基纵横扩张。

A new upper bound for the total domination number of a graph

图的全本征数的一个新上界

Adjacent vertex distinguishing total coloring on 2-connected outer plane graph

2-连通外平面图的邻点可区别全染色

A bar graph showing the total number of queries processed, grouped together by hour.

显示已处理的查询总数的条形图，按小时分组。

On the Equitable Total Chromatic Number of Mycielski Graph of Circle Graph

圈的Mycielski图的均匀全染色

covering a connected graph with bonds of minimum total size

连通图的极小键覆盖

It was expatiated the total network structure of ATS Simulation System for beijing's first one subway, based on this, mostly researched on the Management Database Subsystem of the train running graph information. The design process of static data and dynamic data was also brought forward.

重点研究了文献2中时刻表模拟法仿真系统中的列车运行图资料管理数据库子系统，提出静态数据和动态数据的设计过程，并概括了该子系统的功能及特点。

Then it introduces the BP neural network model, including the process of the construction of the neural network model and study training, and gets neural network fitting residual graph and fitting values of the total amount of construction land from 1998 to 2005.

接着介绍了BP神经网络模型的构建过程，包括神经网络模型的设计和学习训练，得到神经网络拟合残差曲线图和潜江市1998&2009建设用地总量的拟合值。

In this paper, We obtain the total genus polynomials for two new classes of4-regular graphs by using the joint tree model of a graph embedding introduced by Yanpei Liu.

本文利用刘彦佩提出的嵌入的联树模型，得出了两类新的四正则图的完全亏格多项式，并推导出已有结果的两类图的完全亏格多项式。

The graph above shows the total notional value of derivatives relative to US Wealth measures.

以上图表显示:在当前的金融衍生产品的名义价值相对于美国财富措施.

The adjacent vertex distinguishing total chromatic number is obtained for the flower graph.

得到了花图的邻点可区别全色数.

Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices ( i.e., a clique) having the largest total weight.

给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集（团）具有最大权。

The minimum number of colors required for an adjacent vertex-distinguishing total coloring of a simple graph G is called the adjacent vertex-distinguishing total chromatic number, denoted by xat ( G).

若一个正常全染色其相邻顶点的色集不同时，就称之为邻点可区别全染色，邻点可区别全染色所用颜色的最小数称为邻点可区别全色数。

Total Chromatic Study on Complete 4-partite Graph

4部完全图的全着色研究

on this graph we can see the total sales for the first half of the year.

从这个图表我们可以看到今年上半年的总销售额.