圈,cycle英语短句,例句大全

圈,cycle
1)cycle[英]['saikl][美]['sa?k?l]圈
1.Total Coloring Conjecture of Planar Graphs Without l-cycles;不含l-圈平面图的全染色猜想
2.A note on total colorings of planar graphs without 4-cycle and adjacent 3-cycle;不含四圈,三圈不重点的平面图全染色的一个结论
3.On the 3-choosability of Plane Graphs with a Girth of 4 and without 7- and 8- cycles;围长为4的无7-和8-圈的平面图的3-选色

英文短句/例句

1.A loop, as of metal, rope, or thread.金属圈，绳圈，线圈
2.Small circle, small circle, small circle, big circle.小圈、小圈，小圈、大圈，
3.plate-enlargement ring夹板衬圈, 涨圈簧
4.The number of turns of wire in the secondary coil is the same as the number of turns in the primary.次级线圈的圈数和初线线圈圈数一样。
5.floating buoy (excl.lifebuoys)浮圈（不包括救生圈）
6.Coming around. Once more. One more.来了，再一圈，再一圈
7.A life preserver shaped like a ring.救生圈圈状救生用具
8.horse shoe washer开口垫圈,马蹄形垫圈
9.loop pile carpet毛圈式地毡,起圈地毯
10.tapped coil多(接)头线圈, 抽头线圈
11.the equinoctial colure二分圈，昼夜平分圈
12.international geosphere biosphere program国际地圈生物圈计划
13.International Geosphere-Biosphere Programme国际地圈－生物圈计划
14.chev(e)ron ring人字密封圈, v型圈
15.Cat B: 8 laps, each lap 3.8 km, total 30.4 km. The 4th lap is a sprint lap.组：8圈，每圈3.8公里，总共30.4公里，第四圈为冲刺圈。
16.Cat B: 4 laps, each lap 8.5 km, total 34 km. The 2nd lap is a sprint lap.组：4圈，每圈8.5公里，总共34公里，第二圈为冲刺圈。
17.The plane flew round and round in wideloops.飞机翻着大圈一圈一圈地飞行.
18.Merry goes round, goes round, goes round.快乐转了一圈，转了一圈，转了一圈。

相关短句/例句

cycles[英]['saikl][美]['sa?kl?]圈
1.Equitable coloring of planar graphs without 4,5,6-cycles;不含4,5,6-圈的平面图的均匀染色
2.In addition,we determine the signed tree domination numbers for some special classes of graphs G,including cycles,wheels,complete graphs and complete bipartite graphs.引入了图的符号树控制的概念,给出一个连通图G的符号树控制数γ′T(G)的一个上界和一个下界,说明了这两个界限均是最好可能的,并确定几类特殊图的符号树控制数,这包括了圈、轮图、完全图和完全二部图。
3)circle[英]['s?:kl][美]['s?kl?]圈
1.Vertex-distinguishing edge-coloring of graphs with distance between path and circle less than 3 and 4;路和圈的距离不大于3和4的点可区别边染色
2.This paper narrated and proved an minimal spanning tree algorithm which requires no consideration of circles.从树的等价定义出发,叙述并证明了一种不必考虑圈的求最小支撑树的算法。
4)circuit[英]['s?:k?t][美]['s?k?t]圈
1.Borodin and Raspaud proposed a conjecture which claims that every plane graph without 5-circuits and adjacent triangles is 3-colorable.Borod in和Raspaud提出一个猜想:任何既没有5-圈也没有相邻三角形的平面图是3-可着色。
2.In this paper we consider the circuit of minimum total weight problem.讨论权守恒的有向图中最小总权圈问题,分别给出求解一般情况下最小总权圈的最优算法和经过特定点或特定边情况下最小总权圈的最优算法。
3.This article provides a number of new ways to access the famous conjecture on the double covering of graphs by circuits which is still open for more than 20 years in posing a number of conjectures which look to have more approaches than what has been used for the double cover conjecture by circuits.本文提出了一些新的方法以接近图的用圈二重覆盖边的猜想，通称图的双圈覆盖猜想。
5)loop[英][lu:p][美][lup]圈
1.An algorithm for calculating tight optimal double-loop networks G(N;1,s) based on loop;基于圈的紧优双环网络G(N;1,s)求解算法
2.Then we determine the number of subgrahs, heights of components and the lengths of loops for the graph G .在本文中 ,我们将对任意给定的素数p ,确定用上述方法导出的有向图G的有向子图的个数、各分支的高度以及各分支所含的圈的长
6)circle(○)圈(○)