说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 图的坚韧度
1)  Toughness of a graph
图的坚韧度
2)  tough graphs
坚韧图
3)  tough graph
1-坚韧图
1.
It is shown that every 1-tough graph G of order n≥3,XV(G), and σ 3(X)≥n+r≥n, with 3|X|-2n≥8t-6r-17,has a cycle C satisfying |C(X)|≥{|X|,|N(I t)∩X|+|N(I t)∩V(C)|},where It is an independent set of t vertices in X .
记σk(X) =min{ ∑ki =1d(vi) :{v1,v2 ,… ,vk}是G[X]的顶点独立集 } ,得到如下结果 :对于n阶的 1-坚韧图 (n≥ 3) ,X V(G) ,且σ3 (X) ≥n +r≥n ,3|X|- 2n≥ 8t- 6r- 17,则存在一个圈C满足|C(X) |≥ { |X| ,|N(It) ∩X|+|N(It) ∩V(C)|} ,其中It 是X中t个顶点的独立集 。
4)  tenacity [英][ti'næsiti]  [美][tɪ'næsətɪ]
坚韧度
1.
A method, which can scientifically evaluate the role of demand side management (DSM) in the situation that after the remission of N?1 accident the urgent operation pattern develops towards subsequent crisis, including voltage instability crisis and line tripout crisis, and that in enhancing the tenacity of urgent operation pattern, is proposed.
提出了一种科学评价需求侧管理对于缓解N-1事故后的紧急工况向后续危机(包括电压失稳危机和线路跳闸危机)发展的态势以及对提高其坚韧度的作用的方法。
2.
Combining with N-1 security assessment, the urgent operation pattern after N-1 accident is explored; the developing tendency of power system subsequent crisis and the tenacity under the imbalance between power supply and demand is researched in depth.
结合N-1安全评估,考察了N-1事故后的紧急工况,深入研究了在供求矛盾条件下,电网后续危机发展的态势与坚韧度问题。
5)  toughness [英]['tʌfnis]  [美]['tʌfnɪs]
坚韧度
1.
Moreover,the comparison between the changes of connectivity,edge connectivity,edge # connectivity,corivity and toughness are made.
本文提出一种扩充现有网络规模的方法——拟正则圈法 ,并论述了其优点 ;同时通过对扩充前后图的点 -连通度、边 -连通度、边 #-连通度、核度和坚韧度的比较 ,给出了这种方法对网络可靠性的影
2.
In this paper,the eigenvalues of the normalized Laplacian and the toughness of graphs are studied and the relation of inequality between of them is given.
研究了图的正规拉普拉斯矩阵特征值与图的坚韧度,并给出了它们之间的不等式关系。
3.
Moreover,we determine the toughness of the product of two complete graphs.
还给出了两个完全图乘积的坚韧度。
6)  Edge-toughness
边坚韧度
补充资料:图的减缩图(或称图子式)


图的减缩图(或称图子式)
minor of a graph

图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G,,GZ,…,则存在指标i
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条