查询词典 area graph

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-可选择的。

A Halin graph is a planar graph consisting of a tree with no vertex of degree two and a cycly connecting the leaves of the tree. We write .

Halin图是一个在平面上由内部点度数大於2的树及连接树的叶子的圈所组成的平面图，我们将Halin图用来表示。

The above representation of a graph is said to be a plane graph .

一个图的如上所述的表示称为一个平面图。

We stopped by the old fashion ice cream parlor Manhattan Beach Creamery for some refreshment. The "No Shoes, No Shirt, No Problem" sign on the wall epitomizes the beach lifestyle.

我们去商店区的一家老式冰淇淋店坐坐，墙上挂著「没鞋，没上衣，没问题」的牌子完全捕捉了海滩生活的随性及风格。

"If therefore", argues Bellarmine we can offer our prayers and our satisfactions in behalf of those detained in purgatory, because we are members of the great body of Christ, why may not the Vicar of Christ apply to the same souls the superabundant satisfaction of Christ and his saints--of which he is the dispenser?

" "因此，如果"，认为贝拉明（德indulgentiis ，十四）"我们可以提供我们的祈祷和我们满意的代表那些被拘留在炼狱，因为我们是成员的伟大基督的奥体，为什麼可能不是牧师基督适用於同样的灵魂满意的过剩是耶稣和他的圣人-他是在配药？