1) vertex cut
点断集
1.
For a connected graph G,it is defined as b(G)=max{w(G-S)-|S|:S is a vertex cut},where w(G-S)is the number of components of G-S.
对连通图G,它被定义为b(G)=max{w(G-S)-S:S是G的点断集},其中w(G-S)表示G-S的分支数。
2) break point set
断点集
1.
Determination of minimum break point set based on graph theory;
一种新的基于图论确定所有最小断点集方法
2.
It is an important step to select a suitable break point set and the corresponding relative sequence matrix.
断点集BPS(BreakPointSet)是继电保护整定计算的起点,在电力系统继电保护整定计算中选择合适的断点集和相应的整定顺序矩阵是一个很重要的环节。
3) set of discontinuity points
间断点集
4) minimum break point set
最小断点集
1.
In order to decrease the complexity of determining the minimum break point set in a large scale complicated multi-loop power networks,the whole network can be partitioned into several sub-networks in advance.
对大规模复杂环网预先进行网络分割是降低最小断点集问题计算复杂性的有效途径。
2.
Based on the directed graph of primary relay and backup relay s coordination relationships,a new method to determine the minimum break point set(MBPS)by graph simplification is proposed in this paper.
基于保护主后备配合依赖关系有向图,提出了通过有向图化简计算保护配合最小断点集(MBPS)的新方法。
3.
The key procedures to determine optimal coordination sequence of directional protection for multi-loop power network is to solve the minimum break point set (MBPS).
确定复杂环网方向保护最优配合顺序的核心步骤是求解最小断点集(minimum break point set,MBPS)。
5) minimum break point set (MBPS)
最小断点集(MBPS)
6) breakpoint cluster region(BCR)
断裂点集中区域(BCR)
补充资料：李相薨后题断金集
【诗文】：
一览断金集，载悲埋玉人。牙弦千古绝，珠泪万行新。
【注释】：
【出处】：
全唐诗：卷334-30
一览断金集，载悲埋玉人。牙弦千古绝，珠泪万行新。
【注释】：
【出处】：
全唐诗：卷334-30
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条