1) forcing number
强迫数
1.
The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G.
能惟一确定图G的完美匹配M的最小不交边子集所含的边数称作完美匹配M的强迫数。
2.
The cardinality of a forcing set of M with the smallest size is called the forcing number of M, and is denoted by f(G, M).
M的最小强迫集的大小叫做M的强迫数，记作f(G，M)。
2) forcing functions
强迫函数
3) compulsive counting
强迫计数
4) semi-coercive function
半强迫函数
6) forced outage factor
强迫停运系数
补充资料：数不胜数
1.数也数不清。形容很多。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条