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

 primitive graphs 在 数学 分类中 的翻译结果: 查询用时：0.849秒
 在分类学科中查询 所有学科 数学 更多类别查询

 历史查询

 primitive graphs 本原图(0)原始图(2)本原图(2)
 原始图
 Primitive Graphs and Cyclability of Cubic Graphs 原始图与三次图的可圈度 短句来源 Recent results on primitive graphs and on the cyclability of cubic graphs are reviewed and several open problems are proposed. 本文综述关于原始图与三次图的可圈度的近期结果并提出一些未解决的问题． 短句来源
 原始图
 Primitive Graphs and Cyclability of Cubic Graphs 原始图与三次图的可圈度 短句来源 Recent results on primitive graphs and on the cyclability of cubic graphs are reviewed and several open problems are proposed. 本文综述关于原始图与三次图的可圈度的近期结果并提出一些未解决的问题． 短句来源

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

 primitive graphs
 In addition, for d >amp;lt; 4 we list all Cayley graphs of ?d that are limits of minimal vertex-primitive graphs. The Cayley graphs of ?d and the limits of vertex-primitive graphs of HA-type We give a version of Derek Smith's famous theorem for reducing the classification of distance-regular graphs to that of primitive graphs. Our main result shows that it has a very simple description; in particular, locally finite primitive graphs are accessible in the sense of Thomassen and Woess. We investigate the end structure of locally finite primitive graphs. 更多
 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... 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. 本文证明了一类ｎ阶本原无向图有指数ｓ－１的一个充分必要条件，其中ｓ为图的围长 Recent results on primitive graphs and on the cyclability of cubic graphs are reviewed and several open problems are proposed. 本文综述关于原始图与三次图的可圈度的近期结果并提出一些未解决的问题． << 更多相关文摘
 相关查询

 CNKI小工具 在英文学术搜索中查有关primitive graphs的内容 在知识搜索中查有关primitive graphs的内容 在数字搜索中查有关primitive graphs的内容 在概念知识元中查有关primitive graphs的内容 在学术趋势中查有关primitive graphs的内容
 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

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