您要查找的是不是：
- isomorphic digraph 同构有向图
- We shall abbreviate 'directed graph'to digraph. 我们将把“有方向的图”简称为方向图。
- We shall abbreviate "directed graph" to digraph. 我们将把“有方向的图”简称为方向图。
- A digraph D is hamiltonian if D contains a hamilton directed cycle. 如果D中含有一个哈密尔顿有向圈,则称D为哈密尔顿有向图。
- In silicate minerals and magnetites existed isomorph tin. 硅酸盐矿物和磁铁矿中都存在类质同象态锡。
- In this note we give a short proof of enumeration of functional digraph. 本文给出了函数有向图计数式的一个简短证明。
- The returned result is isomorphic in schema and data to the original DataTable. 返回的结果在架构和数据方面与原始的DataTable相同。
- In this paper, we study the total efficient dominating set of a digraph. 本文研究有向图的全有效控制集。
- If a digraph reversal is present, one letter is most likely a vowel. 如果出现了反向双字母组合，其中的一个字母很可能是元音。
- We may thereby compute the number of graphs which are isomorphic to their complements. 因此我们可以计算同构于其补的图的数目。
- Operator recognizes that the single digraph character and the two individual characters are equivalent. 运算符认为该单个二合字母字符与这两个单独的字符是等效的。
- Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency. 如果在两个图之间存在一个保持邻接性的1-1对应，则这两个图是同构的。
- If a matrix game is isomorphic to a matrix game with zero game value, then the latter is called annihilation of the former. 摘要如果矩阵对策同构于一个对策值为零的矩阵对策，那么后者称为前者的零化。
- Finally, the independent analyses and the connections of the two aspects of digraph is discussed. 最后，对有向图的这两个方面进行了独立性分析以及对这两方面的联系进行了论述。
- Therefore ,we can get the following result : G/C_G(F*(G)) is isomorphic to a subgroup of Aut(F*(G)). 因此，下列同态包含关系成立：G/C_G(F~*(G))同态于Aut(F~*(G))的一个子群。
- Rationale: <: is a legal digraph in it's own right, so <:: is interpreted as the same as [:. 理由：<:是一个合法的合体字符，它拥有自己的意义，因此<::被理解为[:.
- A complete ring of sets L is a Lukasiewicz trivalent algebra iff L is isomorphic to a power set lattice. 完备集环 L 是Lukasiewicz三值代数当且仅当L同构到一个幂集格.
- In this paper we provedThorem Euclidian domains with two division algorithms are isomorphic to Z as Euclidian domain. 本文证明了 定理 恰有两个除式的Euclid环同构于Z。
- The two concept lattices which are concept lattice isomorphic with each other are lattice isomorphic with each other. 指出概念格同构是格同构。
- In this paper, we provide a necessary condition and several sufficient conditions for a digraph to have a pair of disjoint quasi-kernels. 在这篇文章中，我们给出了一个有向图有一对不相交的准核的一个必要条件和若干充分条件。
