全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 strong connected 在 数学 分类中 的翻译结果: 查询用时：0.502秒
 历史查询

 strong connected 强连通(5)强连通的(4)
 强连通
 Clear conclusion can be drawn through operation ,that is ,the containing of PrP'~ in ruminant's fodder ,tbe scrapie of the sheep as well as the Bonine Songiform Encephalopathy in the estimate countries can be embodied in the same strong connected fields . 通过对该模型进行运算求解得出清晰的结论：评估国反刍动物饲料中含有PrPBS因子、评估国羊只患痒病和评估国牛患疯牛病包含在同一强连通域。 短句来源 In reference [1], Levine gives strong connected set L. It is stronger than normal connected set. Levine 在［1］ 中给出了L 强连通。 短句来源 This paper gives strong connected set R , which is a set between strongly connected set L and connected set. It has some good qualities. L强连通比一般的连通要强。 R 强连通是介于L 强连通和连通之间的一种连通，它具有一些良好的性质。 短句来源 Strong connected space is less than normal connected space because of strong conditions. 强连通条件较强,因而这种强连通空间就较少. 短句来源 And strong connection is not spreaded to strong connected brance. 而且,强连通无法推广到强连通分支. 短句来源
 强连通的
 In this paper, we prove a new topological minimax theorem. Y is not requierd to be strong connected. The result of Cheng and Lin is a consequence of our theorem. 本文证明了一个新的拓扑Minimax定理,它不要求Y是强连通的,程曹宗与林有浩的结果是我们定理的推论。 短句来源 In this paper,by using the method of algebra,we discuss some expression about the number strong connected component of circulant digraphs,and get bound of strong connectivity of strong connected circulent digraphs. 本文应用代数方法，讨论了有向循环图的强连通分支数的几种表达，以及强连通的有向循环图的强连通度的界。 短句来源 In this paper, by using the method of algebra, we discuss some expression about the number strong connected component of circulant digraphs, and get bound of strong connectivity of strong connected circulent digraphs. 本文应用代数方法，讨论了有向循环图的强连通分支数的几种表达，以及强连通的有向循环图的强连通度的界。 短句来源 For instance, teal number space R is not strong connected. 例如实数空间R就不是强连通的. 短句来源
 “strong connected”译为未确定词的双语例句
 Number Strong Connected Component and Strong Connectirity's Bound of Circulemt Digraphs 有向循环图的强连通分支数以及强连通度的界 短句来源 Number Strong Connected Component and Strong Connectirity's Bound of Circulemt Digraphs 有向循环图的强连通分支数以及强连通度的界 短句来源 The Judging Between Single Connected Graph and Strong Connected Graph 单侧连通图与强连通图的判定 短句来源 It is known that the lattice of continuous extended-real-valued functions C(X,R),in general,is not complete。 In this note, we show that for a topological space X,c(X,R )is a completeHeyting algebra (cHa)if its open sets lattice satisfies V-infinite distributive law in terms of Frame morphism。 As a consequence,we obtain the result that C(X,R ) is a cHa if X is strong connected space。 证明了如下结果：若拓扑空间X的开集格Ω（X）满足V－无穷分配律，则连续函数格C（X，R）是完备Hyting代数 短句来源 This article puts forward a method of judging single lateral connected graph and strong connected graph by alternating. 通过对M(D)的变换,给出了判定单侧连通图与强连通图的一种方法. 短句来源

我想查看译文中含有：的双语例句

 strong connected
 We only prove the part 2 of this theorem in the case that A be a strong connected Boolean matrix. Soroker states and proves that there is a Hamiltonian cycle in every strong connected tournament.
 We have proved the following theorem which is an extension of Brooks theorem : If D is a strong connected digraph without loops or muitiple arcs and if D is neither a directed cycIe nor isomorphic to C_(2n+1)~* or to K_n~*, then d_k(D)≤min {△~-(D), △~+(D)}, where d_k(D) denotes the dichromatic number of D. 本文证明了Brooks定理在有向图上的一个推广:设D是简单的强连通图。如果D不是有向圈或者C_(2n+1)~*或者K_n~*则d_k(D)≤min{△-(D),A~+(D)}。此处d_k(D)表示D的有向色数。 In this paper, we prove a new topological minimax theorem. Y is not requierd to be strong connected. The result of Cheng and Lin is a consequence of our theorem. 本文证明了一个新的拓扑Minimax定理,它不要求Y是强连通的,程曹宗与林有浩的结果是我们定理的推论。 It is known that the lattice of continuous extended-real-valued functions C(X,R),in general,is not complete。 In this note, we show that for a topological space X,c(X,R )is a completeHeyting algebra (cHa)if its open sets lattice satisfies V-infinite distributive law in terms of Frame morphism。 As a consequence,we obtain the result that C(X,R ) is a cHa if X is strong connected space。 证明了如下结果：若拓扑空间Ｘ的开集格Ω（Ｘ）满足Ｖ－无穷分配律，则连续函数格Ｃ（Ｘ，Ｒ）是完备Ｈｙｔｉｎｇ代数 << 更多相关文摘
 相关查询

 CNKI小工具 在英文学术搜索中查有关strong connected的内容 在知识搜索中查有关strong connected的内容 在数字搜索中查有关strong connected的内容 在概念知识元中查有关strong connected的内容 在学术趋势中查有关strong connected的内容
 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社