 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   边传递图 的翻译结果: 查询用时：0.207秒 在分类学科中查询 所有学科 数学 更多类别查询 历史查询  边传递图  “边传递图”译为未确定词的双语例句
 weakly 1/2-transitive graphs are also studied. A minimum weakly 1/2-transitive graph is obtained and the relationship of weakly edge-transitive graphs and weakly 1-arc transitive graphs is discussed. 本文还研究了弱1/2-传递图(即弱边传递而非弱1-弧传递的图)，得到了顶点个数最少的弱1/2-传递图，讨论了弱边传递图是弱1-弧传递图的充要条件，并给出了各种对称性之间的区别与联系； 短句来源 Cubic Edge-transitive Graph of Order 12p 12p阶3度边传递图 短句来源 The graph Γ is said to be G-edge transitive if G is transitive on the set of edges of Γ. 如果G在Γ的边集合上传递,则称Γ是G-边传递图. 短句来源 Edge-transitive Cubic Graph of Order 4pq 4pq阶连通3度边传递图 短句来源 As a result , it is proved that edge-transitive cubic graphs of 8p2 is symmetric, i. e. , there are no semisymmetric cubic graphs of order 8p2. 本文证明了8p~2阶的3度边传递图必是对称图,也就是说,8p~2阶的3度半对称图不存在。 短句来源 更多 相似匹配句对
 Generalized Quaternion Group-edge-transitive-graph 广义四元数群边传递的图 短句来源 Transitive Index of Graph 图的传递指数 短句来源 Restricted Edge Connectivity in Transitive Graphs 传递图中的限制性边连通度(英文) 短句来源 Cubic Edge-transitive Graph of Order 12p 12p阶3度边传递图 短句来源 Edge-transitive automorphism groups of the(5,7)-graph (5,7)—图的边传递自同构群 短句来源 查询“边传递图”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句 没有找到相关例句 All graphs that are generalized quaternion group edge-transitive are determined, the resultes as follow.Theorem: Graph Г contains a automorphism group G that is isomorphic to generalized quaternion group, then Г is generalized quaternion group edge-transitive if and only if. (1) 2~kC_(2~(n-k))(1≤k≤n-1), (2)2~(k+1)K_(1,2~(n-1-k))(-1≤k≤n-1) 运用图的自同构理论,得到了所有广义四元数群边传递的图,结果为:图Г有一个自同构群G同构于广义四元数群,则Г是G 边传递的图当且仅当Г同构于下列图之一:(1)2kC2n-k(1≤k≤n-1),(2)2k+1K1,2n-1-k(-1≤k≤n-1) Let G=(V, E) be a connected graph and SE. S is said to be a r-restricted edge cut, if G-S is disconnected and each component in G-S contains at least r vertices. λ_r(G) is the minimum size of all r-restricted edge cuts. A graph G is said to be λ_r-optimal, if λ_i(G) attains its maximum possible value for i=1,…,r. Wang M. and Li Q. have proved that a vertex-transitive graph with degree d≥4 and girth g≥5or a d-regular edge-transitive graph with d≥4 and g≥4 is λ_((g-1))-optimal. In this paper, we generalize... Let G=(V, E) be a connected graph and SE. S is said to be a r-restricted edge cut, if G-S is disconnected and each component in G-S contains at least r vertices. λ_r(G) is the minimum size of all r-restricted edge cuts. A graph G is said to be λ_r-optimal, if λ_i(G) attains its maximum possible value for i=1,…,r. Wang M. and Li Q. have proved that a vertex-transitive graph with degree d≥4 and girth g≥5or a d-regular edge-transitive graph with d≥4 and g≥4 is λ_((g-1))-optimal. In this paper, we generalize this result by showing that these graphs are in fact λ_g-optimal. 设 G =( V,E)是一个连通图 ,S E是一个边子集 .如果 G -S不再连通 ,且 G -S的每一个连通分支都至少含有 r个点 ,则称 S为一个 r-限制性边割 .最小 r-限制性边割中所含的边数为 G的 r-限制性边连通度 ,记作λr( G) .如果对所有的 i=1 ,… ,r,λi( G)都达到其最大可能值 ,则称 G为λr- 最优图 .王铭和李乔证明了 :若 G是一个 d-正则的点传递图 ,d≥ 4,围长 g≥ 5 ,或者 G是一个 d-正则的边传递图 ,d≥ 4,围长 g≥ 4,则 G是λ(g - 1 ) -最优图 .本文推广了这一结果 ,证明了 :在同样的条件下 ,G是λg- 最优图 Let Γ be a finite simple undirected graph with no isolated vertices , G is a subgroup of Aut(Γ). The graph Γ is said to be G-edge transitive if G is transitive on the set of edges of Γ. We obtain a complete classification of G-edge transitive graphs , which G is a group of prime-power order with a cyclic maximal subgroup. This extend Sander's conclusion. In this paper, we only consider the case that G is isomorphic to group Then Γ is G-edge-transitive if and only if F is one of following graphs Γ是一个有限的、单的、无向的且无孤立点的图, G是Aut(Γ)的一个子群.如果G在Γ的边集合上传递,则称Γ是G-边传递图.我们完全分类了当G为一个有循环的极大子群的素数幂阶群时的G-边传递图.这扩展了Sander的结果.本文仅给出其中的一种情况,即当G同构于群时,所有的G-边传递图.结果为,是G-边传递的当且仅当Γ为下列图之一 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社