查询词典 connected graph

This result have unified the traditional explicit graph searching and implicit graph search, partial searching for one solution and complete searching for all solutions into a same model and some algorithms.

这一结果将传统的显式图搜索与隐式图搜索，求一个解的局部搜索与求全体解的遍历搜索，全部统一到同一个模型和若干算法中去。

The directed graph or transitive graph is constructed by transitivity of partially ordered set.

研究铁路车站作业计划编制过程中，如何编制调机运用计划的关键问题。

The former firstly establishes state graph of power system, and then, with the use of the adjacency matrix and path matrix of the directed graph, fast finds out the key transmission sections suffering greatly from the outages of overload lines through simple calculation of matrix.

前者根据实时网络拓扑结构和潮流分布状态，在对初始电力网络简化、分区的基础上，利用有向图的邻接矩阵与路径矩阵，通过简单的矩阵运算，快速识别出与过载线路相关的关键输电断面；后者直接利用系统各支路的阻抗，从图论算法的基本思想出发，搜索最易遭受大负荷转移的关键传输路径，从而将安全性分析目标从整个网络缩小到某些关键的输电线路。

XEX ~ Arg min{FIy E ~2} where the upper level is about topological structure optimization(a~ is a topological structure varable), and the lower level is a constrained programming about continuous variable y. 2 Apply graph, the action of permutation group on a graph, equiva- lent class, orbit etc.

取得的主要成果有： 1 依点到集的映射、集值映射、二元映射和分离定理等理论首次建立了具有拓扑结构双层规划的数学模型 min F s.t.x∈X y∈Arg min｛F|y∈Ω｝其上层规划为关于离散变量x的拓扑结构优化，下层规划是关于连续变量的约束规划。

In Chapter 2,we prove that:(1)each planar graph without {4,6,7,9}-cycles is 3-colorable;(2)each planar graph without {4,6,8}-cycles is 3-colorable.

在第二章中，我们证明了以下两个结果：(1)每个不包含{4，6，7，9}-圈的平面图是3-可染色的；(2)每个不包含{4，6，8}-圈的平面图是3-可染色的。

We therefore sometimes refer to a planar embedding of a planar graph as a plane graph.

一个平图G把平面划分成若干个连通区域，这些区域的闭包称为G的面。

Network analysis can be realised by means of the graph structure, and faces management is allowed by the planar characteristic of the graph: for any given oriented arc, there is only one face on the right, and one face on the left.

网络分析可以通过图的结构来实现，同时，图的平面特征允许面的操作：对于任意的有向弧，只有一个面位于它的右边，一个位于左边。

Any graph which can be redrawn in this way without crossings is called a planar graph,such graphs being of the utmost importance in the theory of graphs.

任何能够按这种方式重画为一个没有交叉线的图称为平面图，这种图在图论中极为重要。

Any graph which can be redraen in this way without crossing is called a planar graph,such graphs being of the utmost importance in the theory of graphs.

一个图如果能够按这种方式重画为一个没有交叉线的图成为平面图，这种图在图论中极端重要。

In Chapter 3,we obtain that:(1)each planar graph without 4-cycles is acyclically 6-choosable;(2)each planar graph without 4-cycles and without triangles at dis-tance less than 3 is acyclically 5-choosable.

在第三章中，我们获得了以下两个结果：(1)每个不包含4-圈的平面图是无圈6-可选择的；(2)每个不包含4-圈并且任意两个三角形之间的距离至少是3的平面图是无圈5-可选择的。

Foods high in this vitamin include oily fish such as salmon, tuna and, and fish liver oils.

维生素D含量高的食物包括诸如大麻哈鱼、金枪鱼和鲭鱼之类的油鱼以及鱼肝油。

We need you to cosign our public letter demanding that press intimidation cease immediately, and that all charges be dropped.

我们需要您cosign我们的公共信，要求记者立即停止恐吓，并要求所有收费下降。