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

图标索引 历史查询
 

primitive graph
相关语句
  “primitive graph”译为未确定词的双语例句
     In this paper, we prove a sufficient and necessary condition for a primitive graph G to have exponent s-1 where s is odd girth of the graph G.
     本文证明了一类n阶本原无向图有指数s-1的一个充分必要条件,其中s为图的围长
短句来源
     By citing feature primitive graph instances and standard attachments and then positioning them, the workpiece drawing and assembly drawing of indexable turning tools are set up.
     通过对特征图素的实例化、拼装和对标准附件的引用,建立了刀具工作图和装配图。
短句来源
  相似匹配句对
     [s,t]-GRAPH
     [s,t]-图及其Hamilton性
短句来源
     The Research on Graph Primitive′s Pickup Methods
     关于图形拾取方法的探讨
短句来源
     Graph Theory.
     Graph Theory。
短句来源
     In the primitive subsect.
     在原始的菝葜叶铁线莲亚组subsect.
短句来源
     The Extremal Graph ofκth Upper Generalized Exponents for a Class of Primitive Graphs
     一类本原无向图的广义上指数的极图
短句来源
查询“primitive graph”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  primitive graph
The main idea behind the GVST is to decompose each rule-graph into a sequence of primitive graph refinements.
      
This is related to the use of local storage resources which is not easily exploitable with a primitive graph.
      
Scheduling a macro-operation graph that uses two functional resources gives better results that the scheduling of the corresponding primitive graph.
      


Ab~ract The present paper is mainly devoted to the discussion of the problem Whether or not s~2-3s+4,s~2- 3s+3,s~2-3s+2,s~2-3s+1 and s~2-4s+7 are missing number in the primitive index ,When s≥5 The main resillts ameng others are as follow. Theorem 1. Lev D be primituve graph ,K be an arbitrarily given positive integer. If r(D)≤ K≤t(D). then there exists a vertex i of D such that the ergodic index r_s=/k. Theorem 2 Let D be a primitive graph with s vertices and the length of the minimal cycle of D is...

Ab~ract The present paper is mainly devoted to the discussion of the problem Whether or not s~2-3s+4,s~2- 3s+3,s~2-3s+2,s~2-3s+1 and s~2-4s+7 are missing number in the primitive index ,When s≥5 The main resillts ameng others are as follow. Theorem 1. Lev D be primituve graph ,K be an arbitrarily given positive integer. If r(D)≤ K≤t(D). then there exists a vertex i of D such that the ergodic index r_s=/k. Theorem 2 Let D be a primitive graph with s vertices and the length of the minimal cycle of D is l. the t(D)≤s+l(s-2). Corollary 1. For all graph D of order s. the upper bound of primitive index is s~2-2s+2 which is also supremum. Corollary 2. s~2-2s……,s~2-3s+5 are all missing number in the primitive index (s≥5)

本文在[1]、[2]的基础上,对s≥5时,s-3s+4,s~2-3s+3,s~2-3s+2以及s~2-3s+1到s~2一4s+7这一区段内的本原指标缺数的情形进行了讨论,得到了明确的结论。同时,又对[1]中的一些结论重新给出了较为简洁的证明。

In this paper, we prove a sufficient and necessary condition for a primitive graph G to have exponent s-1 where s is odd girth of the graph G.

本文证明了一类n阶本原无向图有指数s-1的一个充分必要条件,其中s为图的围长

Recent results on primitive graphs and on the cyclability of cubic graphs are reviewed and several open problems are proposed.

本文综述关于原始图与三次图的可圈度的近期结果并提出一些未解决的问题.

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

 


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

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