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

 孤立边 的翻译结果: 查询用时：0.347秒
 在分类学科中查询 所有学科 计算机软件及计算机应用 更多类别查询

 历史查询

 孤立边
 isolated edge
 Restricted edge cut separates a connected graph into a disconnected one without isolated vertex. Graph G is super restricted edge connected if no subgraph but an isolated edge can be separated by any minimum restricted edge cut. 限制边割将连通图分离成不含孤立点的不连通图 ,如果最小限制边割只能分离孤立边 ,则称图G是超级限制边连通的 . 短句来源 Binary de Bruijn networks are proved to be maximal restricted edge connected, their minimum restricted edge cuts can separate no subgraph but an isolated edge or a triangle. 证明了二元 de Bruijn网络是极大限制边连通的 ,并且它们的最小限制边割只能分离一条孤立边或者一个三角形 . 短句来源
 “孤立边”译为未确定词的双语例句
 (3) For a given graph G which has no isolated vertices, G~(+-+) is super-λ if and only if G has no isolated edges and G (?) K_(1,n). (3)G~(+-+)是super-λ的当且仅当G没有孤立点和孤立边且G不 短句来源 One match of G is a generating subgraph of G. Every branch is a single point or a single side. 设G是有n个点的图 ,G的一个匹配是指G的一个生成子图 ,它的每个分支或是孤立点或是孤立边 . 短句来源 A graph G is A'-optimal if the restricted edge connectivity A' (G) equals to the minimum edge degree ζ(G), and super-λ' if every minimum restricted edge cut of G isolates an edge. 一个图G为最优-λ'图,如果其限制性边连通度λ'(G)等于其最小边度ζ(G). 一个最优-λ'图被称为超-λ'图,如果从G中去掉任何一个最小限制性边割都会产生孤立边. 短句来源
 相似匹配句对
 SOLITARY WAVE SOLUTION OF INITIAL-BOUNDARY VALUE PROBLEM OF BOUSSINESQ EQUATION BOUSSINESQ方程初边值问题的孤立波解 短句来源 The weight of a edge is denoted by w(e). W(e)表示边e的权。 短句来源 ON SEARCHING FOR AN EDGE IN A GRAPH 寻边问题 短句来源 ISOLATED WORD RECOGNIZATION 孤立字词识别 短句来源 Sufficient and necessary condition on isolated extreme 孤立极值的充要条件 短句来源

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

 isolated edge
 New metal oxide pyroxene compound NaVGe2O6 containing isolated edge-sharing VO6 (S=1) chains undergoes transition into a long-range antiferromagnetic state at TN=16 K. The isolated edge-diffracted part can be identified as the difference between the far field scattered by a half plane and one half of the far field scattered by the entire plane. An edge cut of a connected graph is called restricted if it separates this graph into components each having order at least 2; a graph G is super restricted edge connected if G-S contains an isolated edge for every minimum restricted edge cut S of G. Moreover we found a nontrivial field modulation of the T*c(H) line with an inversion, with increasing field, of the modulation concavity which we assigned to a crossover from a collective to an isolated edge state regime. A probabilistic relaxation labeling, which enforces border smoothness is used to remove isolated edge pixels and ll boundary gaps. 更多
 The graphs with M(G) ≤2 are characterized G is a graph with n points.One match of G is a generating subgraph of G.Every branch is a single point or a single side. 完全刻画了匹配最大根M(G)≤ 2的图G .设G是有n个点的图 ,G的一个匹配是指G的一个生成子图 ,它的每个分支或是孤立点或是孤立边 . Restricted edge cut separates a connected graph into a disconnected one without isolated vertex.Graph G is super restricted edge connected if no subgraph but an isolated edge can be separated by any minimum restricted edge cut.It is proved that k regular connected graph G is super restricted edge connected if k>|G|/2+1 . The lower bound on k is exemplified to be sharp to some extent. 限制边割将连通图分离成不含孤立点的不连通图 ,如果最小限制边割只能分离孤立边 ,则称图G是超级限制边连通的 .证明了如果k >|G|/ 2 +1,那么k正则连通图G是超级限制边连通的 ,k的下界在一定程度上是不可改进的 . Binary de Bruijn networks are proved to be maximal restricted edge connected, their minimum restricted edge cuts can separate no subgraph but an isolated edge or a triangle. Employing this observation, we analyze the reliability of binary de Bruijn networks and determine the first four coefficients in their reliability polynomials. 证明了二元 de Bruijn网络是极大限制边连通的 ,并且它们的最小限制边割只能分离一条孤立边或者一个三角形 .利用此结果分析了二元 de Bruijn网络的可靠性 ,确定了它们的可靠多项式的前四项系数 . << 更多相关文摘
 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

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