查询词典 connected graph

Lamadian Oilfield static state map plan system includes data pretreatment subsystem and development geology charting subsystem and geological map sheet access subsystem, realizes the function of drawing for the Lamadian Oilfield development well location map and skeleton structure section map and connected section graph and Sedimentary facies chart and tectonic maps, and realizes various types of geological map data storage and query functions.

本文研究的喇嘛甸油田静态图幅绘制系统包括：绘图数据预处理子系统、开发地质制图子系统和地质图幅存取子系统，实现了喇嘛甸油田开发井位图、骨架剖面图、连通剖面图、沉积相带图、断层剖面图和断层实际资料图的绘制功能以及各类地质图件资料的存储及查询功能。

Defined character degree's graph Г and proved that if Г is not connected then 2≤nl ≤4 for the Fitting height nl of solvable group G.

对有限群G，O.Manz等人定义了特征标次数图Γ，并且证明了：若Γ不连通，则可解群G的Fitiing高nl满足2≤nl≤4。

By the means of combinatorial matrix, the relation between minimum degree of connected graph and upper bound of spectral radius was carefully depicted.

利用组合矩阵方法，精细地刻画出连通图的最小度与谱半径的上界之间的关系，在一定条件下改进了以前的一个结果。

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.

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

In this thesis, we consider connected cubic Bi-Cayley graphs and a special Bi-Cayley graph for the symmetric group.

在这篇论文中，我们考虑连通三正则BC和对称群上的BC。

Let G be a k-regular connected vertex transitive graph.

设图G是一个κ-正则连通点可迁图。

This observation strenghen to some extent the corresponding result obtained by Watkins, which said that k-regular vertex transitive graph G has a factor with components isomorphic to a vertex transitive graphs if G is not k connected.

此结果在某种程度上加强了Watkins的相应命题：如果κ正则点可迁图G不是κ连通的，那么G有一个因子，它的每一个分支都同构于同一个点可迁图。

In mobile Ad Hoc networks, geographical routing protocol was a kind of important routing protocols, which requires the underlying topology be planar, sparse, connected and t-spanner in order to guarantee the delivery of message and bound the routing length. A new topology control algorithm named ODT, which constructed the geometry structure named ODT graph, was proposed.

基于移动Ad Hoc网络的特性，提出了一种适用于移动Ad Hoc网络的路由协议PAGPSR(Power-Aware Greedy Perimeter Stateless Routing)，该协议在原有的基于地理位置的路由协议GPSR的基础上增加了节点能量感知和负载均衡算法，修改了GPSR的转发策略，使网络中能量消耗和网络负荷分布更加均匀，从而延长了整个网络的生存时间。

Using this algorithm, arbitrary two vertexes in a given undirected graph can achieve a required vertex-connected degree.

利用该算法可最优地将给定无向图中任意2点达到所要求的点连通度。

Let G be an undirected, simple and connected graph.

最小限制边割所含的边数称为G的限制边连通度(有向图的限制边连通度可类似给出)。

There had been a moment during the breakfast meeting, though, after the backslapping and the small talk and when all of us were seated, with Vice President Cheney eating his eggs Benedict impassively and Karl Rove at the far end of the table discreetly checking his BlackBerry, that I witnessed a different side of the man.

那次早餐会期间，在表示过关心和寒暄以后，我们所有人坐了下来，我注意观察了一下，副总统切尼面无表情地吃着班尼迪克蛋（Eggs benedict，源自美国，以英式松饼、火腿、水煮蛋以及荷兰酱组合而成），卡尔。罗夫在餐桌的远端谨慎地经常查看他的黑莓手机，我目睹了他所不为人知的一面。

Talk Undelete failed; someone else may have undeleted the page first.

Talk 无法删除选定的页面或图像（它可能已经被其他人删除了）。