1) patternrepaeat
图案循环
2) cyclogram
['saikləu,ɡræm]
循环图表
1.
A new method is put forward in this paper to direct the shaft sinking by using the tracing cyclogram.
本文提出用跟踪的循环图表指导立井掘进。
3) round-robin tournaments
循环赛图
1.
The enumeration problem of round-robin tournaments and perfect matchings are discussed.
给出了边矩阵和循环赛图的定义。
2.
The entire procedure of forming round-robin tournaments of 8 and 16 players is presented.
为解决2n名选手循环赛安排问题,给出了边矩阵及循环赛图的定义。
4) cyclic graph
循环图
1.
Adjacent-vertex-distinguishing total chromatic numbers on two classes of 4-regular cyclic graphs;
两类4-正则循环图的邻点可区别全色数
2.
The induced matching extendability of cyclic graph with 2n vertices and step length 1 and 4;
步长为1和4的2n阶循环图的导出匹配可扩性
3.
The fractional chromatic numberof a kind of 4-regular cyclic graphs;
一类4-正则循环图的分数点色数
5) circulant graphs
循环图
1.
The Domination Parameters of Generalized Petersen Graphs and Circulant Graphs;
循环图和广义Petersen图的支配参数
2.
For the given integers s_1,s_2,…,s_k,1≤s_1≤s_2≤…≤s_k, a simple method for determining the asymptotics of the number of spanning trees in the (undirected) circulant graph C~s_(n~1),s_2,…s_k was developed, and this method was applied to several circulant graphs.
就给定的整数s1,s2,…,sk,1≤s1≤s2≤…≤sk,给出了一种简单的方法来计算Cs1,s2,…,skn中生成树个数的渐近性质,证明了该渐近性可以归结为求解一个次数为2sk-2的多项式,并将这种计算方法应用到若干个循环图作为例子。
3.
By disassembling and unhooking circulant links we can find the recurrence relation for the number of Eulerian orientations of one class of circulant graphs,so to give the explicit counting.
通过拆分解构的方法可以找到与一类循环图中Eulerian定向数有关的递推关系,从而给出该数的精确计数。
6) circulant graph
循环图
1.
Study of graph corresponding to product of two adjacency matrices to two circulant graphs;
两个循环图的邻接矩阵的乘积矩阵对应图的研究
2.
A study of isomorphism of circulant graphs of fourth degree and fifth degree;
四度与五度循环图的同构的研究
3.
Isomorphic factorization of some circulant graphs with even degree;
某些偶数度循环图的同构因子分解
补充资料：循环系统的进化环节动物的封闭式循环系统
李瑞端绘
[图]
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条