1、There fore we study the kings of locally semicomplete digraph by its characterization.
文章通過研究局部半完全有向圖的結(jié)構(gòu)定理，分類討論了它中的王。

2、Thus, the problem of efficiently finding the basic set of directed circuits in a digraph is solved.
從而解決了求有向回路基集的有效算法問題。

3、A digraph D is hamiltonian if D contains a hamilton directed cycle.
如果D中含有一個(gè)哈密爾頓有向圈,則稱D為哈密爾頓有向圖。

4、A fast algorithm for generating Chinese word segmentation digraph was given.
給出了一種漢語分詞有向圖的快速生成算法。

5、A two-dimensional placement method of minimum area is presented by digraph representation.
本文采用有向圖表示、提出一種二維的最小區(qū)域布局方法。

6、Finally, the independent analyses and the connections of the two aspects of digraph is discussed.
最后，對有向圖的這兩個(gè)方面進(jìn)行了獨(dú)立性分析以及對這兩方面的聯(lián)系進(jìn)行了論述。

7、A digraph D is hamiltonian if D contains a hamilton directed cycle
如果D中含有一個(gè)哈密爾頓有向圈,則稱D為哈密爾頓有向圖。

8、By using Boolean matrix, some results of power convergence exponent of line digraph are given.
采用布爾矩陣，得到了線有向冪斂指數(shù)的一些結(jié)果。

9、ON ARC-TRANSITIVE CAYLEY DIGRAPH OF ABEL GROUPS
Abel群上的弧傳遞Cayley有向圖

digraph翻譯