| 1. | Otherwise g is disconnected .
否则称G是不连通的。 |
| 2. | This happens if the graph is disconnected or has a cutvertex .
如果一个图是不连通的或有割点，就发生这种情况。 |
| 3. | Even an air-entraining agent can be used because the minute pores are discontinuous .
甚至可以使用加气剂，因为小的气孔是不连通的。 |
| 4. | A class fractal set of perfect disconnected
一类完全不连通的分形集合 |
| 5. | Otherwise g is disconnected
否则称g是不连通的。 |
| 6. | This algorithm could fast determine disconnected depressions and their influence areas on the basis of acquiring digital tide - coordinates shorelines ( dts )
此算法在提取数字伴潮海岸线( dts )的基础上，快速确定不连通的洼地及其影响域。 |
| 7. | In chapter 2 , we study the simple separable function sets ( m = 2 ) whose relation graph are connective or disconnective respectively , and achieve some useful results
第二章分别对关系图连通和不连通的二元单纯可离函数集进行讨论，获得了一些有用的结果。 |
| 8. | Gradient - based multidisciplinary design optimization methods can not be used directly to problems with discrete and integral design variables or with disjoint design space , and they have a propensity to converge to a relative optimum closest to the starting point
摘要现有基于梯度的多学科设计优化算法难于处理具有离散和整数设计变量、设计空间非凸或不连通的多学科设计优化问题，并且倾向于收敛到接近初始点的局部最优点。 |
| 9. | Let f be a biquadratic polynomial , then ( 1 ) the julia set of f is connected if and only if the orbits of all critical pionts are bounded ; ( 2 ) the julia set of f is totally disconnected if and only if every connected component of the filled julia set of f containing critical points is not periodic under iterations : ( 3 ) if f does not satisfy the conditions ( 1 ) and ( 2 ) , then the julia set of f has infinitely many non - trivial connected components , where a component is trivial if it contains only one point
A集是完全不连通的当且仅当f的任何临界声、不属于填充julm集的周期分支内。你当j的临界卢、不满足条件小， ” j时， f的几ha集有可数个非平凡的连通分支，这里，一个分支是平凡的，如果它仅由一个卢、组成。 。 |
| 10. | But the difficulty with these two parameters is that they do not take into account what remains after the graph is disconnected . in fact , on one hand , it is often found that two graphs with the same number of vertices ( edges ) and the same connectivity ( edge - connectivity ) ) may result in entirely different forms after a minimum disconnecting set of vertices ( edges ) is removed , one may be totally disconnected while the other may consist of a few very stable components , and thus be much easier to reconstruct
对于两个具有相同点(边)数，具有相同点连通度(边连通度)的图，从图中分别去掉使图不连通的点(边)集后，所得图的结构可能完全不同，这是因为点连通度、边连通度和局部点、边连通度等连通性参数仅反映了系统被破坏的难易程度，而对系统遭受破坏的程度并没有明确的反映。 |
