全部

1·Digraphs have a simple pictorial representation.

有向图有简单的图形表示。

2·Digraphs should not be typed with adjacent fingers.

高频组合不宜在相邻手指。

3·Some theorems about fundamental properties of the digraphs are proved.

本文证明了几个关于有向图基本性质的定理。

4·The hierarchical strategy for digraphs reduces search space for failure sources;

采用有向图分层策略，减小故障源搜索空间的大小；

5·Special primitive two-colored digraphs whose uncolored digraph consist of two cycles are considered.

研究一类特殊的本原双色有向图，其未着色的有向图包含两个圈。

6·Nonetheless, those alternative tokens that aren't lexical keywords are colloquially known as digraphs.

虽然如此，这些不是关键字词汇的候选标记仍被通俗地称为“双连符”。

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

首先，我们给出一些图的邻接谱半径的一些新的可达上界，并说明这些新结果在一定情形下比已有的结果要好。

8·Minimizing edge crossing is a key problem in drawing layered digraphs, and it's directly involved with the readability of the graph.

最小化边交叉数是层次图绘制过程中的一个关键步骤，直接影响着层次图的可读性。

9·In this paper, the lower bound problems of the maximum genus and the genus distributions of digraphs in orientable surfaces are studied.

本论文主要研究了图的最大亏格的下界问题以及有向图类在可定向曲面上嵌入的亏格分布。

10·Moreover, we also find the relation between Markov digraphs and renewal digraphs, similar to that between Markov chains and renewal sequences.

而且，我们还提出一种所谓更新图，它和马尔可夫图的关系类似于更新序列和马尔可夫链的关系。