1) base number of cycle
圈基数
1.
1, the adjacency tree graph T(G) of simple connected graph G is a complete graph if and only if base number of cycle ρ(G)=1 and the length of the cycle is three.
文献1给出了简单连通图G的邻接树图T(G)是完全图的充分必要条件是:G的圈基数ρ(G)=1且此回路的长度为3。
2) cyclomatic number
基圈数
1.
In this paper,the authors characterize the minimum real roots of the adjoint polynomials of a class connected graphs with character3 and cyclomatic number 3,in which the root extreme graphs are given.
刻画了特征标为-3、基圈数为3的连通图族伴随多项式的最小根,给出了其对应的根极值图。
2.
In this paper,the minimum real roots of the adjoint polynomials of a class of connected graphs with character-2 and cyclomatic number 2 were characterized,in which the root extremal graphs were g.
本文主要刻画了特征标为-2、基圈数为2的连通图族伴随多项式的最小根,给出了其对应的根极值图,并通过比较这些极图的最小根给出了此类连通图族伴随多项式最小根的序。
3.
By suppressing all the vertices of degree 2 of the 2 connected plane graph, we can obtain its reduction graph with the same cyclomatic number.
所有的 2 -连通平图可通过收缩 2度点变换成无 2度点的、基圈数不变的 2 -连通平图 。
3) basic loop algebra
基本圈代数
1.
Let kZn be the basic loop algebra with n verlices,A=kZn/Jd be the d-truncated algebra.
设kZn是域k上n个顶点的基本圈代数,A=kZn/Jd是d-次基本截面代数,计算了基本截面代数A的Cartan矩阵C,并给出Cartan矩阵可逆的充分必要条件。
4) scroll cycle
涡圈圈数
补充资料：基数标准(见基数)
基数标准(见基数)
level of basic load
lishu biaozhun基数标准(level of basic load)见基数。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条