查询词典 bipartite graph

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 graph is bipartite if it does not contain an odd cycle.

一个图是二部图，如果它不包含奇圈。

If enough edges have been drawn to make the figure connected the graph is called bipartite.

如果有足够的线使图连通，这图称为双图。

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是一个完全图。

Several of the graph problems we have discussed in this book can be modeled as network flow, including bipartite matching, shortest path, and edge/vertex connectivity.

一些图的问题我们已经讨论过这本书可以作为网络流模型，包括双边匹配，最短路径，和EDGE /顶点连接。

We transform the redundant via insertion problem into a mixed bipartite-conflict graph matching problem, and present a novel heuristic minimum weighted matching algorithm to solve it.

我们把插入多余贯穿点的问题转换成混合二部碰撞图形的匹配问题，并提出一个新颖的启发式最小加权匹配演算法去解决此问题。

Bipartite matching is adopted to adjust the relations between the constraint equations and variables, and then the matching result is mapped to a data structure named Engineering Constraint Graph. A solving sequence is achieved by topology sort and strong connected component condensation of ECG.

先使用二分图最大匹配调整约束方程与自变量之间的匹配关系，然后将匹配结果映射为工程约束图，通过对工程约束图进行强连通分量凝聚和拓扑排序，得到求解序列。

Based on the properties of associated surfaces for complete bipartite graphs,a new type of graph J with weak symmetry is constructed.At the same time,the minimum genus of it is derived.Finally,the number of genus embeddings of complete bipartite graphs is easily estimated.

然后基于完全二部图关联曲面的特点进行推广，构造了对称性比较弱的新图类J且得其最小亏格，最后对完全二部图不同最小亏格嵌入的数目作了估算。

When 〓 is the family of bipartite graphs,the 〓 capacityand the 〓 valency of a graph G are referred to as the biparticitydenoted by β(Gand the bivalencydenoted by 〓(Gof G respectively;when 〓 is the family ofgraphs whose components are complete bipartite graphs,the 〓 capacity and the〓 valency of a graph G are referred to as the complete biparticitydenoted byc(Gand the complete bipartite valencydenoted by 〓(Gof G respectively;andwhen 〓 is the family of star forests,the 〓 capacity and the 〓 valency of a graphG are referred to as the star arboricitydenoted by st(Gand the star valency ofG(denoted by 〓)respectively.

以v记图G的完全二部分解中顶点υ所关联的π中完全二部图的个数，记〓这里π取遍G的所有完全二部分解。我们称υ为G的完全二部次。对一般的图，当图的阶数充分大时，P。〓和L.Pyber给出了υ的一个上界，即，〓。F.R.K.Chung等人及Z.Tuza的结果说明这一上界是不可改进的。对υ的具体值，即使是对某些特殊的图类，结果也知之甚少。P.C.Fishburn和P.L.Hammer给出了一个相关的结果：当n≤16时，〓，（在υ的定义中，以完全二部覆盖替代完全二部分解，即得〓。同时他们提出了下述公开问题。问题1。〓=？

On the other hand, the more important thing is because the urban housing is a kind of heterogeneity products.

另一方面，更重要的是由于城市住房是一种异质性产品。

Climate histogram is the fall that collects place measure calm value, cent serves as cross axle for a few equal interval, the area that the frequency that the value appears according to place is accumulated and becomes will be determined inside each interval, discharge the graph that rise with post, also be called histogram.

气候直方图是将所收集的降水量测定值，分为几个相等的区间作为横轴，并将各区间内所测定值依所出现的次数累积而成的面积，用柱子排起来的图形，也叫做柱状图。