有向图

However the reachability matrix is difficult to get. It is proved that there is no need to calculate the reachability matrix fur a Directed Acyclic Graph.

证明了对于一类特殊的有向图即有向无环图，应用解释结构建模法无须求解可达矩阵亦可保证建模结构化的实现。

A new method was proposed for grindability comprehensive evaluation of engineering ceramic materials based on the digraph theory in the graph.

应用图论中的有向图理论，以材料磨削加工性属性为顶点，以各属性之间的相互关系为边，建立了陶瓷材料磨削加工性评价的有向图模型。

This paper presented an improved Digraph, the General Digraph.

提出一种改进的有向图法——一般有向图法。

At the research course with eigenvalues of digraphs,all need to hold digraph melt into form of matrix,research eigenvalue of matrix again.

在研究有向图的特征值的过程中，都要把有向图化为矩阵的形式，再研究矩阵的特征值。

Using matrix theory,we present a sharp upper bound on the spectral radius of digraph s and strongly connected diagraphs.

利用矩阵理论，给出了简单有向图的谱半径可达上界和强连通有向图的谱半径上界

Furthermore, this model is expanded in two aspects: on the one hand, through the introduction of the theory of the Fault Tree, this thesis analyzes the difference between the fault-diagnosis in the recovering flow and that in the traditional flow, thus concluding that the fault-diagnosis in the recovering flow is just a tracing-back process of the directed-graph and the Fault Tree; on the other hand, a finite self-restoring state machine is constructed on the directed-graph model, thus providing the theoretical basis for the realization of the auto-recovery model.

随后在两个方面对该模型进行了扩展：1。通过引入故障树的方法，并在分析了恢复流程故障诊断与传统故障诊断的差异之后，总结出恢复流程的故障诊断就是一个基于有向图和故障树进行回溯的过程；2。基于有向图模型建立了一个有穷自动状态机，为自动恢复与模型的实现提供了理论基础。

Digraph was used to express the static topological structure of product, restraints as well as dynamic transition relationship of information. The digraph was decomposed into several sub-graphs to express the multilevel structure of the product.

产品的静态拓扑结构、约束关系和动态信息传递关系用有向图来表达，并将有向图分解为子图的形式来表示产品的多层结构关系。

The design is the preparation of plans and the establishment of export, the use of storage structure order to establish a map and undirected graph, Output of adjacency matrix and map the depth and breadth of priority traversal sequence.

本设计是编写关于图的建立以及输出，使用顺序存储结构建立有向图和无向图，输出图的邻接矩阵以及图的深度优先和广度优先遍历次序。

Locally in/out-semicomplete digraphs are important generalizations of semicomplete digraphs.

局部内半完全有向图是半完全有向图的一个重要的推广图类。

In the project, we found a method for designing a family of 4-optimal double loop networks, established some sharp upper bounds of forwarding indices, distance domination nember, the edge-connectivity and the sharp upper bounds of wide-diameter and fault-tolerant diameter of Cartesian product graphs, the lower bounds of restricted edge-connectivity of digraphs and a sufficient and necessary condition for the restricted edge-connectivity of a graph to be equal to the restricted connectivity of its line graphs; raveled pancyclicity and panconnectivity and obtained the exact values of the mentioned parameters for some well-known networks.

本项目给出最优双环网络的设计方法，找到4紧优双环网络无限族，建立了路由转发指数紧的界，确定了笛卡尔乘积图的边连通度的表达式，宽直径和容错直径紧的上界，给出有向图限制边连通度的下界和无向图的限制边连通度等于它的线图限制点连通度的充要条件，对一些著名的网络确定了上述参数的精确值，讨论了宽直径和容错直径之间的关系，解决了超立方体某些变型网络的泛圈性和泛连通性，得到距离控制数的紧的上界。

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.

这是凯特，那个是爱朗。