1.
Feedback Number of Generalized Kautz Digraphs GK(2,n) and Alternating Group Graphs AG_n
广义Kautz有向图GK（2，n）和交错群图AG_n的反馈数
2.
k-Restricted Edge Connectivity of a Class of Kautz Graphs
一类无向Kautz图的k限制边连通性
3.
The Upper Bound on k-Restricted Edge Connectivity of a Class of Kautz Graphs
一类无向Kautz图的k限制边连通度的上界
4.
A New Upper Bound for the Isoperimetric Number of Kautz Graph;
Kautz图的等周数的一个新上界
5.
Algorithm for Finding All One-way Sub-graph of Simple Digraph;
简单有向图所有单向分图的求解算法
6.
We shall abbreviate 'directed graph'to digraph.
我们将把“有方向的图”简称为方向图。
7.
Digraphs have a simple pictorial representation.
有向图有简单的图形表示。
8.
A digraph D is unilateral.
有向图d是单连的。
9.
The Study of the Hamiltonian Qualities in Digraph;
有向图Hamilton性质的研究
10.
Three Problems about Distances in Graphs and Digraphs;
与无向图及有向图中距离有关的三个问题
11.
The Number of Directed Cycles in a Directed Graph Based on the Arc Determinant
基于弧行列式的有向图中的有向圈数
12.
If (a, b) (ba) then the graph is a directed graph.
如果（a，b）≠（b，a），则这个图是有向图。
13.
THE EXTREMAL DIGRAPHS OF THE kTH UPPER GENERALIZED EXPONENT FOR k-UPPER PRIMITIVE SYMMETRIC DIGRAPHS
上本原对称有向图上广义指数的极图
14.
A Product Selective Disassembly Model Based on Hybrid Directed Graph
面向目标拆卸的产品复合有向图建模
15.
If the edges are ordered pairs of vertices then we get the notions of a directed graph and directed multigraph.
如果边都是顶点的有序对，则得到有向图和有向重图的概念。
16.
An Algorithm for Generating Directed Cutsets of Directed Cycling Graph Based on Edge Contracted
基于边被收缩图的有向有环图有向割集求解算法
17.
Predictive Functional Control Based on Kautz Model With Optimum Compensating Method
基于Kautz模型的优化补偿预测函数控制
18.
An Algorithm for Finding All Euler Cycles in Digraph;
求有向图的所有Euler回路算法