Vertex degree sum 顶点度和
smallest degree sum 最小度和
large degree sum graph 大次和条件图
weight sum of membership degree 模糊隶属度加权求和
unequal order sum squeezing degree 不等幂次高次和压缩效应
Degree sum conditions of ID-factor-critical graphs are studied. A lower bound for the degree sum of any two nonadjacent vertices such that G is ID-factor-critical is obtained, and the bound is sharp.
本文研究ID-因子临界图的度和条件,得到使得图G是ID-因子临界图的任意两个不相邻的顶点的度和的下界,同时说明这些结果是最好可能的。
Rule 4: Largest sum of degree of morphemic freedom of one-character words.
规则4:单字单词的语素自由度的最大和。
It is common sense that the sum of the Angle of triangle is 180 degree and the sum of any two sides of a triangle is greater than the third side.
三角形三个角之和是180度,三角形任意两边之和大于第三边,这些都是常识。
应用推荐