 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   six vertices 的翻译结果: 查询用时：0.008秒 在分类学科中查询 所有学科 数学 更多类别查询 历史查询  six vertices 六点(8)6点(6)  六点
 The existence of three types of G_i-design (i=1,2,3) where G_i with six vertices and eight edges will be discussed, that is, (υ,G_i,1)-GD (i=1, 2,3) exists iff υ≡0,1 mod(16) and ≥16. 本文讨论了三类六点八边图 (υ,Gi,1) -GD (i=1,2 ,3)的图设计存在问题 ,即 (υ ,Gi,1) -GD (i=1,2 ,3)存在的充要条件是υ≡ 0 ,1mod(16 )且υ≥ 16 . 短句来源 In this paper,we discussed the existence problem of two graphs G1G2,each of which is with six vertices and eight edges,and showed that(v,Gi,1)-GD(i=1,2) exist if and only if v≡ 0,1(mod 16) and v≥ 16. 文章讨论了两个六点八边图G1和G2的图设计存在性问题,并证明了(v,Gi,1)-GD(i=1,2)存在的必要条件v≡0,1(mod 16)且vE 16也是充分的. 短句来源 The Design Method of a Graph with Six Vertices and Seven Edges 一个六点七边图的特殊图设计构造 短句来源 A G-design with Six Vertices and Eight Edges 关于一个六点八边图的图设计 短句来源 In this paper, the maximum packing design and minimun covering design of two graphs with six vertices and nine edges are researched. 本文中,两个六点九边图的最大填充设计与最小覆盖设计被研究。 短句来源 更多 6点
 The existence of G i optimal packing is discussed,where G i=K 2,3 +e(i =1,2)has six vertices and seven edges. 讨论了 2类 6点 7边图 Gi =K2 ,3+e(i =1 ,2 )的最优填充存在性问题 . 短句来源 The existence of G ioptimal packing is discussed,where G i=K 2,3+e(i=1,2)has six vertices and seven edges. 主要讨论了 2类 6点 7边图 Gi=K2 ,3 + e( i=1 ,2 )的最优填充存在性问题 . 短句来源 The graph design for a graph G_1 with six vertices and eight edges is discussed,and the following existence result is obtained:G_1GD_λ(v) exists if and only if λv(v-1)≡0(mod16),v≥6. 利用"差方法"、"带洞图设计"等工具,结合一系列小设计的构作,对1个6点8边图G1的图设计进行了讨论,并证明了:存在G1GDλ(v) λv(v-1)≡0(mod16),v≥6. 短句来源 By means of "diference method" and "holey graph design",graph design for a graph C with six vertices and eight edges is discussed,and the following existence result is obtained:C-GD(v) exists if and only if v≡0,1(mod 16),v≥6. 利用"差方法"、"带洞图设计"等工具,结合一系列小设计的构作,对6点8边图C的图设计进行了讨论,并证明了存在CGD(v) v≡0,1(mod16),v≥6. 短句来源 The graph design for a graph H with six vertices and nine edges is discussed,and the following existence result is obtained:HGD(v) exists if and only if v≡0,1(mod?9) and v≠9. 运用"差方法"、"带洞图设计"等工具,结合一系列小设计的构作,对一个6点9边图H的图设计进行了讨论,并证明了:存在HGD(v) v≡0,1(mod9)且v≠9. 短句来源 更多 “six vertices”译为未确定词的双语例句
 CYCLES CONTAINING A SET OF SIX VERTICES AND TWO EDGES IN CUBIC PLANAR GRAPHS 三次平面图中包含六点二边集的圈 短句来源 Let H be a finite simple graph. A graph design H-GD(v) is a pair (X, B), where X is the vertex set of Kv and B is a partition of all edges in Kv, such that each member (block) of B is a subgraph of Kv, isomophic to H.In this thesis, we discuss the existence problems of graph design for eight graphs with six vertices and nine edges. 对于有限简单图H，一个图设计H-GD_λ(v)是一个序偶(X，B)，其中X是K_v的顶点集，B为λK_v的全部边的一种分拆，其每个成员(区组)都是与H同构的子图。 短句来源 查询“six vertices”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  six vertices
 We demonstrate that there is always an open set of linear transformations such that the image curves have at least six vertices. From a hexagon arises a contact conic ofU6, touchingU6 at each of the six vertices. We shall see many of its properties (such as its uniqueness and existence, the order of the full collineation group and Segre's theorem) by looking at a structure as simple as the complete graph on six vertices. It turns out that 37 of the models are isomorphic to the 37 non-empty, triangle-free graphs with six vertices. It is proved that the Seidel-equivalent of aLB3(6) graphG with respect to a partition (W1,W2) of its vertex set is a pseudo-LB3(6) graph if and only ifW1 consists of six vertices lying on a line ofG. 更多 A special form of the Stewart platform is presented in which the top platform and base platform are similar and corresponding vertices are connected by six prismatic joints.A closed-from solution for the forward displacement analysis of this mechanism is developed.When the six vertices of the top platform are in a quadratic curve,this mechanism becomes singular.This new theoretical result is confirmed with a numerical example. 讨论了一种上、下平台相似且对应顶点相联的 Stewart 机构.给出了这种形式的Stewart 机构的正位移分析的封闭解,并且发现,当上平台的6个顶点在同一二次曲线上时,机构变为几何异形机构,此时不论机构处于何种位置都是奇异的.用数值实例验证了这个结果. Let λK_v be the complete multigraph with v vertices, where any two distinct vertices x and y are joined by λ edges (x,y). Let G be a finite simple graph. A Gcovering design of λK_v,denoted by (v,G,λ)CD , is a pair(X,B) where X is the vertex set and B is a collection of subgraphs of K_v, called blocks, such that each block is isomorphic to G and any two distinct vertices in K_v are joined in at least λ blocks of B. In this paper, we discussed the existence of G_ioptimal covering, where G_i=K_ 2,3+e(i=1,2)... Let λK_v be the complete multigraph with v vertices, where any two distinct vertices x and y are joined by λ edges (x,y). Let G be a finite simple graph. A Gcovering design of λK_v,denoted by (v,G,λ)CD , is a pair(X,B) where X is the vertex set and B is a collection of subgraphs of K_v, called blocks, such that each block is isomorphic to G and any two distinct vertices in K_v are joined in at least λ blocks of B. In this paper, we discussed the existence of G_ioptimal covering, where G_i=K_ 2,3+e(i=1,2) has six vertices and seven edges. We have obtained the result:(v,G_i,λ)OCD,i=1,2 exist if v≥6, with the not optimal values C(6,G_i,1)=4. 设λKv是λ重 v点完全图 ,G为一个无孤立点的有限简单图 .λKv的一个 G-覆盖设计 ,记为(v,G,λ) - CD,是指一个对子 (X,B) ,其中 X为点集 ,B为 λKv 的一些子图 (亦称为区组 )构成的集合 ,使得任一区组均与 G同构 ,且任意两个不同点组成的边至少在 B的 λ个区组中出现 .讨论了两类六点七边图 Gi=K2 ,3+e(i=1,2 )的最优覆盖的存在性问题 .证明了存在 (v,Gi,λ) -OCD,i=1,2 ,当且仅当 v≥ 6,除去非最优 (但为最大 )的 C(6,G1,1) =4 . Let λK v be a complete mulfiple graph with v vevtices,G be a finite simple graph.A G-design of λK v,denited by (v,G,λ)GD,is a pair(X,B),where X is the vertex set of λK v and B is collection of sub-graphs(called blocks) of λK v,such that each block is isomorphic to G and any edge in λK v occur in exactly λ block of B.The existence of G i-design was discussed where G i=K 2,3+e(i=1,2) has six vertices and seven edges.The result was obtained:(v,G i,λ)GD,i=1,2 exist iff 14 |λv(v-1),v≥6,and (v,λ)≠(7,1),(8,1).... Let λK v be a complete mulfiple graph with v vevtices,G be a finite simple graph.A G-design of λK v,denited by (v,G,λ)GD,is a pair(X,B),where X is the vertex set of λK v and B is collection of sub-graphs(called blocks) of λK v,such that each block is isomorphic to G and any edge in λK v occur in exactly λ block of B.The existence of G i-design was discussed where G i=K 2,3+e(i=1,2) has six vertices and seven edges.The result was obtained:(v,G i,λ)GD,i=1,2 exist iff 14 |λv(v-1),v≥6,and (v,λ)≠(7,1),(8,1). λKv 是一个λ重 v点完全图 ,G为一个不带孤立点的简单图 .λKv 的一个 G设计 ,常记为 ( v,G,λ) GD,是指一个对子 ( X,B) ,其中 X为 Kv 的点集 ,B为 Kv 的一些子图 (亦称为区组 )构成的集合 ,使得任一区组均与图 G同构 ,且 Kv 的任意 2个不同点组成的边恰在 B的 λ个区组中出现 .现讨论了 2类 6点 7边图 Gi=K2 ,3 + e( i=1 ,2 )的图设计存在性问题 ,证明了存在 ( v,Gi,λ) GD( i=1 ,2 )当且仅当 1 4 | λv( v-1 ) ,v≥6 ,且 ( v,λ)≠ ( 7,1 ) ,( 8,1 ) . << 更多相关文摘 相关查询

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

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