助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   strong connected 的翻译结果: 查询用时:0.009秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

strong connected
相关语句
  强连通
     In reference [1], Levine gives strong connected set L. It is stronger than normal connected set.
     Levine 在[1] 中给出了L 强连通
短句来源
     The algorithm is efficient and easy to realize because it is based on searching the maximum strong connected sub nets and the preset and post place set of transitions.
     算法主要计算工作是变迁的前序库所集和后继变迁集以及极大强连通子网的判断 ,这三个过程实际上是一个树的搜索过程 ,因此算法易于实现 ,判定效率也大大提高
短句来源
     In activities identification phase,coupled activities was identified by Boolean operation of adjacent matrix,accessible matrix and strong connected matrix.
     在活动识别阶段,通过邻接矩阵、可达矩阵和强连通矩阵,对耦合活动进行识别。
短句来源
     Strong connected space is less than normal connected space because of strong conditions.
     强连通条件较强,因而这种强连通空间就较少.
短句来源
     One is based on cluster, CLTC, in intracluster the cluster head carries out an algorithm which is to make the cluster strong connected and in interclusters the transmitting power of those border nodes between different clusters is controlled by the cluster head, and this step is to make the interclusters strong connected.
     一种是基于群的强连通拓扑控制算法CLTC,群内由群首执行强连通算法,使得本群的拓扑强连通; 群间则由每个群首调整那些担负群间的边界节点的发射功率,使得群间也强连通
短句来源
更多       
  强连通的
     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”译为未确定词的双语例句
     Although PEMB materials industry is a branch of manufacturing industry, it is strong connected with construction and steel industry.
     预制式钢结构建筑材料行业属于制造业的一个分支,但它又与建筑行业、钢铁行业紧密相连,处于几个行业的交叉点上。
短句来源
     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代数
短句来源
更多       
查询“strong connected”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  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是强连通的,程曹宗与林有浩的结果是我们定理的推论。

Extend the estimations of the index of primitivity of a nonnegative matrix to aprimitive operator over a polyhedral cone. We introduce the directed graph of K_m-nonnega-tive operator,and discuss the relations among the directed graph,K_m-irreducible operatorand K_M-primitive operator. Our main result is that if A ∈Ⅱ(K_m)is primitive operator,andG(A)is strong connected, hen γ(A)≤(m+s(m-2),where s is the shortest simple circuitin G(A).Thus,the result of dulmage and Mendelsohn is a special case.

继续文献[5]工作,将非负矩阵的素性指标估计推广到多面体锥上的素性算子。通过对多面体锥上非负算子有向图的引入,讨论了多面体锥上非负算子的有向图G(A)与K_m-不可约算子,K_m-素性算子的关系,对非负矩阵素性指标的一些结论进行了推广,主要结果为:若A∈Ⅱ(K_m)为素性算子,且G(A)是强连接的,则对A的素性指标估计有γ(A)≤m+s(m-2),其中s是G(A)中最小简单闭路的长度。这样使得文献[1]中结论成为本文的一个特殊情况。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关strong connected的内容
在知识搜索中查有关strong connected的内容
在数字搜索中查有关strong connected的内容
在概念知识元中查有关strong connected的内容
在学术趋势中查有关strong connected的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社