连通分支 meaning in English
connected components
Examples
- 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集有可数个非平凡的连通分支，这里，一个分支是平凡的，如果它仅由一个卢、组成。 。 - In this paper , three correlative results are given : 1 ) the average crossing number of graph with n vertices and q edges can be signified approximately by quadratic equation of q . 2 ) the average crossing number of graphs with bigger girth is greater than that with smaller girth within given vertices and edges . 3 ) the average crossing number of r - regular graphs greater than that of non - regular graphs within given vertices and edges where n is odd or r < n / 2
并得出相关的规律： 1 ) n个顶点q条边的单二连通分支图的平均交叉数aac ( n , q )可近似地表示为q的二次多项式， 2 )在给定顶点数n与边数q的单二连通分支图中围长较大的图的平均交叉数大于围长较小的图的平均交叉数， 3 )在给定顶点数n与边数q的单二连通分支图中当n为奇数或r n / 2时， r正则图的平均交叉数大于非r正则图的平均交叉数。 - In this paper , we first give some sufficient conditions for t in a tree t : theorem4 . 1 : let d be a set of t , if the vertices of d are all hooks and each middle vertex of t relative to d has only one neighbor in d , then ji = y , ? theorem4 . 2 : let d be a yrset of t , if the vertices of d are all hooks and the connected components of [ d ] : d1 , d2 , . . . . . . ,
首先这篇文章给出了在树中_ l与_ t相等的一些充分条件：定理4 . 1 ：设d是树t的_ t集合，若d中每点都是钩子，且t关于d的每个中介点都只与[ d ]的一个连通分支相关联，则_ l = _ t 。 - In the paper , the connectivity and diameters of sell - complementary 2 - multigraphs and sell - complementary digraphs are discussed , and if these graphs get disrupted the relations for the number ob edges and vertices between the two connected components are also studied in self - complementary permutation
摘要本文讨论了2 -重自补图和有向自补图的连通性以及2 -重自补图的直径，同时以自补置换作为工具研究了当2 -重自补图或有向自补图被分成两个连通分支后，这两个连通分支之间的边数与顶点数之间的关系。