查询词典 connected graph

We have two problems: 1: How many surfaces can a graph be embedded in? 2: How many distinct embeddings of a graph are there on the given surface?

图的嵌入理论是拓扑图论一个重要的研究内容，嵌入理论中主要的研究问题有图的可嵌入理论和计数理论。

To find density altitude, either at field elevation or while in flight, enter the graph with pressure altitude at left and temperature at base of graph.

找到密度的高度，无论是在外地或抬高，而在飞行中，输入的图形与压力，海拔高度在左侧的温度在相应的图形。

Firstly, this algorithm maps a given routing instance to the corresponding graph model, which is a kind of asymmetric grid graph suitable for BBL mode.

在本文中，我们在本教研室原来研究的基础上，就物理设计中BBL模式下典型的多端线网绕障碍布线问题，提出了一种基于生物仿生特性的蚁群算法，通过选择适当的图模型表述，该算法可采用蚁群任务调度策略，模仿蚁群的协同学习机制，来求解多端线网绕障碍的布线问题，并能给出较优的解。

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。〓=？

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

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

As a general rule of thumb, a single connected entity graph should only be associated to a single unit of work at a time.

作为一般规则的经验，一个单一的连接实体图应该只能与一个单位的工作时间。

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

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

Basis on this result, Chen, Lih and Wu put forth the following conjecture:Conjecture 2 For any connected graph G, except K_m, C_(2m+1) and K_(2m+1,2m+1) for all m ≥ 0,then G is equitably △—colorable .

基于这一结果，Chen，Lih和Wu提出了以下猜想：猜想2：如果图G是一个既不是完全图，奇圈又不是完全二部图K_(2m+1，2m+1)，m≥0的连通图，那么G存在均匀Δ-染色。

A filter graph is aa complete mechanism (different filters connected together) which is needed to run a media file.

过滤器图是一个完整的机制（不同的过滤器连接在一起），这是需要运行一个媒体文件。

Autonomous systems of the Internet form a huge complex network connected by physical links,in which the autonomous systems and links among them can be regarded as vertices and edges of an undirected graph.

因特网的自治系统(AutonomousSystem简称AS)构成了一个由物理链路连接起来的庞大的复杂网络，其中的自治系统及其之间的连接可以看作是无向图中的顶点和边。

There are different types of personal loans available.

有许多不同类型的个人贷款优惠。

The above mentioned teaching model of spiral rising can be used to avoid rigidness in teaching.

上述螺旋式上升的教学模式，可以避免教学形成模式後的僵化现象。