助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   cyclic graph 的翻译结果: 查询用时:0.208秒
图标索引 在分类学科中查询
所有学科
数学
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

cyclic graph
相关语句
  循环图
     Five new lower bounds of Ramsey numbers R(3,q) are obtained by using the cyclic graph of prime order: R(3,25)≥150,R(3,26)≥158,R(3,27)≥164,R(3,28)≥168,R(3,29)≥180.
     利用素数阶循环图,得到Ram sey数R(3,q)的5个新下界:R(3,25)≥150,R(3,26)≥158,R(3,27)≥164,R(3,28)≥168,R(3,29)≥180.
短句来源
     Four prime order cyclic graph are structured,and new lower bounds of four Ramsey numbers is obtained: R(5, 12 )≥150, R(5, 13)≥158, R (5, 14)≥182, R (5, 15 ) ≥198.
     构造4个素数阶循环图,得到了4个Ramsey数的新下界:R(5,12)≥150,R(5,13)≥158,R(5,14)≥182,R(5,15)≥198.
短句来源
     Four prime order cyclic graph are structured,so iowerbounds of four Ramsey numbers is obtained: R (5,16)≥234, R (5,19)≥314, R (5,20)≥332, R (5,22)≥380.
     本文构造了4个新的素数阶循环图,从而得到了4个Ramsey数的下界:R(5,16)≥234,R(5,19)≥314,R(5,20)≥332,R(5,22)≥380。
短句来源
     Prime Order Cyclic Graph and New Lower Bounds of Classical Ramsey Numbers R(8,16),R(8,17) and R(8,18)
     素数阶循环图与经典Ramsey数R(8,16),R(8,17)和R(8,18)的新下界
短句来源
     Three new prime order cyclic graph were structured, so three lower bounds of Ramsey numbers were obtained: R(4,20)≥200, R(4,21)≥224, R(4, 22)≥252.
     构造了3个新的素数阶循环图,从而得到了3个Ramsey数的下界:R(4,20)≥200,R(4,21)≥224,R(4,22)≥252.
短句来源
更多       
  “cyclic graph”译为未确定词的双语例句
     2 . we study the tree graphs T_G of the double cyclic graph.
     2.研究了双圈图的树图T_G的结构,并进而给出了树图T_G的谱半径的界:
短句来源
     A new prime order cyclic graph are structured, so lower bound of Ramsey number isobtained: R(4, 23 ) ≥272.
     本文构造了1个新的素数阶循环圈,从而得到了1个Ramsey数的下界:R(4,23)≥272。
短句来源
     5 . (1) If m = n - 1, G is a tree, then F(G) = 0.(2) If m = n, G is a single cyclic graph, then F(G) = g — 3, where g is the girth of G.
     5.对于边数m较少时连通图的填充数,我们有以下结果: (1)当m=n-1时,图G为树,则F(G)=0。
短句来源
     We say that the graph G is a D—Cyclic graph if there is a cycle C in G such that V (G)/V (C) is an independence set of G.
     在图G中,如果存在圈C使得V(G)╲V(C)是G的独立点集。 则说G是一个D-Cyclic图,而C是G的一个D-圈。
短句来源
     We prove that a CP matrix A having cyclic graph has exactly two minimal rank 1 factorization if det M(A) > 0 and has exactly one minimal rank 1 factorization if detM(A) = 0.
     本文证明,图是围的完全正矩阵A当比较矩阵M(A)的行列式大于零时,恰有两个极小秩1分解,而当detM(A)=0时,恰有一个极小秩1分解.
短句来源
更多       
  相似匹配句对
     On D-cyclic in Graph
     关于图中的支配圈
短句来源
     [s,t]-GRAPH
     [s,t]-图及其Hamilton性
短句来源
     On The Smallest Graph Whose Group Is Cyclic
     关于循环群的最小图
短句来源
     D—CYCLIC CRAPHS
     D—Cyclic图
短句来源
     For a graph G.
     对于图G.
短句来源
查询“cyclic graph”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  cyclic graph
In this paper we study the homotopy type of Hom(Cm,Cn), where Ck is the cyclic graph with k vertices.
      
In the cyclic pursuit game the evader, BLUE, and the pursuer, RED, choose one of the vertices of ann point cyclic graph at discrete time 1.
      
Pursuit on a cyclic graph - The symmetric stochastic case
      
The conjecture of zero domination of 0-cyclic monotone graphs is proved (anr-cyclic graph is a cyclic monotone (s, t)-graph exactlyr minimal paths of which have cycles).
      
We should note that by virtue of containing all feasible motions, the lattice is a cyclic graph.
      
更多          


Professor Alspach advanced a conjecture about factorization of the cyclic graph in 1983.He conjectures that if G is a cyclic graph and t E(G) , then tG.

图的因子分解是图论中近年来十分活跃而且十分困难的一个课题。1983年著名图论学家A1spach教授在新加坡召开的图论学术会议上提出了“对所有循环图可分条件意味着存在一个同构因子分解”的猜想!本文就其猜想证明了以下结论:1.具有n个顶点的2K度连通循环图G,若t|n,则t|G;2.具有n个顶点的R度连通循环图G,若t|n/2,则t|G;3.G是三度或四度循环图,若t||E(G|,则t|G。

We say that the graph G is a D—Cyclic graph if there is a cycle C in G such that V (G)/V (C) is an independence set of G. In the paper, we prove the following Veldman's Conjecture: If G is a K—connected graph with n vertices(K≥2)such that, for every k+1 mutually remote edges e_0, e_1,……e_k of G then G is D—Cyclic.

在图G中,如果存在圈C使得V(G)╲V(C)是G的独立点集。则说G是一个D-Cyclic图,而C是G的一个D-圈。在本文中,我们证明了下述的Veldman猜想:设G是n阶的k-连通图(k≥2),且对任何k+1条相互隔开的边e_0,e_1,…,e_k,都有sum from i=0 to k d(e_i)>1/3(k+1)(n-2)则G是D—Cyclic图。

Using a computer, we have constructed four cyclic graphs, None of them contains K3. The first graph has 63 vertices and does not contain K14. The second has 72 vertices and does not contain K15. The third has 78 vertices and does not contain K16. The last has 87 vertices and does not contain K17. Hence we show that r (3, 14)≥64, r(3, 15)≥73, r(3, 16)≥79 and r(3, 17)≥88.

我们利用计算机来构造既没有三角形又没有q个顶点的独立集的循环图。当q=14、15、16,17时,由我们构造的循环图得到Ramsey数的四个新下界: r(3,14)≥64; r(3,15)≥73; r(3,16)≥79; r(3,17)≥88。

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

 


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

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