G is super restricted edge connected if its every minimum restricted edgecut separates exactly one edge.
如果它的任一最小限制边割都孤立一条有最小边度的边。
2
G is called a super restricted edge connected graph if every minimum restricted edgecut separates exactly one edge.
一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。
3
The finite volume method was used to compute the aerodynamic load, and the effect of leading-edgecut and ribs on the pressure distribution was analyzed simultaneously.