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

 complete graph 的翻译结果: 查询用时：0.008秒
 历史查询

 complete graph 完全图(185)完备图(7)
 完全图
 Decomposition of Complete Graph K_n into {P_4, S_4,C_4} 完全图K_n的{P_4,S_4,C_4}-分解 短句来源 and gives necessary and sufficient conditions for complete graph K_n to have {C_4, S_4},{P_4, C_4}, {P_4, S_4} and {P_4, S_4,C_4} decomposition and coercive decomposition. 给出完全图K_n存在{C_4,S_4},{P_4,C_4},{P_4,S_4},{P_4,S_4,C_4}分解以及强制分解的充要条件. 短句来源 A constructive method is employed to study all kinds of edge coloration of complete graph K97, thus the new lower bounds of four Ramsey numbers are finally achieved, namely, R(3, 3, 8)≥98, R(3, 4, 6)≥98, R(3, 5, 5)≥98, R(3, 18)≥98. 用构造性方法研究完全图K97的边的各种染色，得到4个经典Ramsey数的新下界： R（3，3，8）≥98，R（3，4，6）≥98，R（3，5，5）≥98， R（3，18）≥98。 短句来源 If there exists a partition {V_1,V_2,…,V_n} of V(G) such that G[V_i] is a multiple complete graph of each 1≤i≤n,then G has a C-partition. 图G的C 划分是指:G的一个顶点划分{V1,V2,…,Vn},使得每个G[Vi]为多重完全图(1≤i≤n)。 短句来源 Three New Lower Bounds of Circle vs Ramsey Numbers r(C_4,K_(n+1)) of a Complete Graph 圈对完全图Ramsey数r(C_4,K_(n+1))的3个新下界 短句来源 更多
 完备图
 The isolated toughness 7(G) is defined as follows: If G is a complete graph, then 7(G) = +∞; 图G的孤立韧度I(G)定义为:若G是完备图,I(G)=+∞; 短句来源 Decompositions of Complete Graph into (2k-1)-Circles with One Chord 完备图分拆为带一条弦的(2k—1)-长圈(英文) 短句来源 Enumeration of All Trees of a Complete Graph——A Simplified Algorithm and its Application 求完备图的全部树——一种简易算法及应用 短句来源 In order to simulate the whole process of the network evolution from the tree to complete graph and to solve the problem that existing adjacency nodes encoding was only suitable for the network with low density, and the traditional crossover and mutation would give rise to a lot of infeasible solution, a variable length gene encoding based on triangle matrix and operators including crossover between gene segments, mutation and balance among gene segments is proposed. 为了模拟复杂最优网络从树演化到完备图的整个过程,解决现有邻接节点编码方法只适用于低密度网络,而传统的交叉变异方法又有大量不可行解的问题,提出了基于三角阵的变长基因编码方法和段间交叉、段内变异平衡的交叉变异方法. 短句来源 The article gives some calculating equations about binding number of the following graphs:the join graph of two circles,a complete graph and a complete bipartite graph,some complete graph's copies and some complete bipartite graph's copies. 给出了两个圈的联图、完备图与完备二部图的联图以及若干完备图的并与若干完备二部图的并之联图等几类联图的联结数的计算公式。 短句来源 更多
 “complete graph”译为未确定词的双语例句
 Let K~(+s)_(m+1)(m,m+1)=｛N_m∨(K_(m+1)-S)｜S is a subgraph of complete graph K_(m+1),｜S｜=s｝. K+m+s 1(m,m+1)表示图集{Nm∨Km+1-S S是Km+1的子图,S=s}. 短句来源 Basing on network distance, CA2DSW and CADC, the complete graph communication model in DGDN (CMDGDN) was designed. 基于网络距离机制、CA2DSW和CADC,设计了DGDN上的通信模型CMDGDN。 短句来源 A Class of (1,2)—Factorizations of a Complete Graph 完全偶图的一类(1,2)因子分解 短句来源 A perfect one-factorization of a complete graph K_(2n), is one-factorizations in which every pair of distinct one-factors forms a Hamiltonian cycle of K_(2n). K_(2n)的1-因子分解称为完美的,如果它的任意两个不同的1-因子的并形成K_(2n)的Hamilton圈. 短句来源 The complete graph K m,n has (1,2)-factors with minimum and maximum edges , and the (1,2)-factorizations of K m,n are given by Theorem 1 and Theorem 2. 完全偶图Km,n存在具有最小边数和最大边数的(1,2)—因子,定理1和定理2给出了Km,n的上述(1,2)—因子分解. 短句来源 更多

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

 complete graph
 Given a complete graph with vertex setX and subsetsX1,X2,…,Xn, the problem of finding a subgraphG with minimum number of edges such that for everyi=1,2,…,n, G contains a spanning tree onXi, arises in the design of vacuum systems. The Hubbard model on a complete graph: exact analytical results The Sznajd model, which describes opinion formation and social influence, is treated analytically on a complete graph. In particular, it is shown that -1?λ2(G)?(n-2)/2, and the left hand equality holds if and only ifG is a complete graph with at least two vertices; the right hand equality holds if and only ifn is even andG?2Kn/2. Then using this we prove that a bipartite graphy with an inverse monoid is uniquelyK2, and that a graphG has an inverse monoid if and only if the join ofG and a complete graph also has an inverse monoid. 更多
 Dennis Geller and Bennet Manvel have proved that cactigraphs in which every block is either a circuit or an edge,are reconstructible(1).This conclusion is extended in the present paper to the case of super-cacti-graphs,in which every block is an eulerian graph,a complete graph or a complete bipartite graph.It is further noticed and discussed here that the case in which a graph has three or more centres was neglected in the cited literature(1)(Since outerplanar graphs are reconstructible(2),the... Dennis Geller and Bennet Manvel have proved that cactigraphs in which every block is either a circuit or an edge,are reconstructible(1).This conclusion is extended in the present paper to the case of super-cacti-graphs,in which every block is an eulerian graph,a complete graph or a complete bipartite graph.It is further noticed and discussed here that the case in which a graph has three or more centres was neglected in the cited literature(1)(Since outerplanar graphs are reconstructible(2),the result of(1) is still holding) 一九六九年Dennis Geller和Bennet Manvet证明了每一块都是回路或边的连通图——仙人掌图是可重构的。本文把这一结果推广到每一块是E图、完全图和完全二分图的情况。 我们注意到文[1]中忽略了多中心的情况(由于外可平面图可重构,故文[1]中的结论仍成立),并对此情况进行了讨论。 In this paper,some properties regarding the chromatic polynomials of graph on the complete-graph-basis and the chromaticity of some graphs by complete-graph- basis are discussed. 文章讨论了建立在完全图基上的色多项式的若干性质。并利用完全图基讨论了一些多边图的色性。 In this paper,a new concept to solve the production for permutation by means of graph theory is suggested.The relationship between Hamiltonian circuit of complete graph K_n and complete permutation for N elements is discussed,and the Hamiltonian circuit algorithm that produces all permutations of N elements is also presented. 本文提出用图论来解决排列的产生。论述了完全图 K_n 的 Hamilton 回路与 n 个元素的所有排列的关系,给出了产生 n 个元素全排列的 Hamilton 回路法。 << 更多相关文摘
 相关查询

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

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

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