有向图

In this paper, we provide a necessary condition and several sufficient conditions for a digraph to have a pair of disjoint quasi-kernels.

在这篇文章中，我们给出了一个有向图有一对不相交的准核的一个必要条件和若干充分条件。

This result gives impetus to resolving Yeo's conjecture and the problem of complementary cycles in multipartite digraph.

这对于解决Yeo的猜想和多部有向图的共轭圈问题有一定的意义。

By the General Digraph, you can construct fault trees automatically not only for simple control systems but also for complex control systems.

使用这一方法，不但能较好地完成简单控制系统的自动建树，而且可以较好地完成有较复杂控制结构的控制系统的自动建树，克服了传统有向图法自动建树的困难。

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 suffered greatly from the outages of overload lines through simple calculation of matrix. In the latter, the minimal short transmission path, the length of which is calculated with line impedance, is determined with graph theory to focus on security analysis objects from the whole network to some key transmission lines.

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

After the circuit is abstracted as a directed graph, circuits matching problem is solved by subgraph isomorphism algorithm.

将电路抽象成有向图的数学模型后，采用了子图同构算法实现电路匹配。

The problem of complementary cycles in tournaments was completely solved. However, for semicomplete multi-partite digraphs, the problem of complementary cycles is still open.

竞赛图的共轭圈问题已经完全解决，而关于多部有向图的共轭圈问题仍然是一个open问题。

After giving the data structure , this article ransacks FEARG using breadth traversal and find the assembly sequence .

在给出有向图的数据结构后，对装配关系图进行了广度遍历得到了装配序列。

In this paper, Entringers problem is extended to directed graphs and get serveral results about uniquely pancyclic digraphs.

本文将Entringer这个问题推广到定向图中，研究了唯一泛圈有向图的若干问题。

For the general model with rooted forest precedence constraints jobs or series-parallel digraphs jobs, the optimal algorithms are presented.

对增长率与基本加工时间相关且工件具有有跟森林约束和有串并有向图约束的的单机问题进行研究，分别给出了最优算法。

Whenever individuality of "atomic" components is important for correct representation of whatever is modeled by graphs, the model is refined by imposing additional restrictions on the structure, and other mathematical objects are used: digraphs, labeled graphs, colored graphs, rooted trees and so on.

每当个性&原子&元件重要的是正确的代表性，无论是模拟的图表，模型是完善施加额外限制的结构，和其他数学对象使用：有向图，标记图，彩色图表，扎根树等。

Singer Leona Lewis and former Led Zeppelin guitarist Jimmy Page emerged as the bus transformed into a grass-covered carnival float, and the pair combined for a rendition of "Whole Lotta Love".

歌手leona刘易斯和前率领的飞艇的吉他手吉米页出现巴士转化为基层所涵盖的嘉年华花车，和一双合并为一移交&整个lotta爱&。

This is Kate, and that's Erin.

这是凯特，那个是爱朗。