连通

It is proved that all monic polynomials of order n with roots lying in some open region on the complex plane forms a simply connected set in the polynomial parameter space. Based on this result, Edge Theorems for D-stability of general polyhedrons of polynomials and Boundary Theorems for D-stability of compact sets of polynomials are obtained.

证明了其根位于复平面中某开域的所有n阶多项式的全体构成多项式参数空间中的一个单连通集，并基于这一结果进一步提出了关于一般多面体多项式族D-稳定性的棱边定理和关于一般多项式紧集D-稳定性的边界定理。

It also links up with cruises on the Moselle and Danube rivers.

还可以连通法国的摩泽尔河和多瑙河。

The communications mode under computer control system which composes such as large covered area、wider frequency band、longer transmission distance、bigger volume、high quality、flexibility and multi-address connections.

利用卫星通信与航天技术相结合并由计算机实现控制的通信方式，其优点是覆盖面积大、频带宽、传输距离远、容量大、质量好、机动灵活并可实现多址连通等优点。

One is theexplicit formula for strict-connected acyclic hypergraphs:〓where a=r-d,m=/a;the other is the recurrence formula for linearacyclic hypergraphs:〓where the numbers of r-1 and r in the multinomial coefficient are j and krespectively,〓 and 〓.

一个是关于严格-维连通无圈超图的显式公式：〓其中a=r-d，m=/a；另一个是线形无圈超图的递推公式：1=〓其中r-1与r在多重组合数中的重数分别是j与k，〓且f(0，r)=1。

During the pre-processing of the finite element analysis, the interactive subdivision method which combines the computer's high efficiency with human's intelligence is realized. The dummy node method, which is used to solve the subdivision problem about multiply connected region and the region with isolated verge combining the optimization algorithm in topology, is brought forward for the first time in this dissertation.

在有限元分析的前处理中，本文实现了既充分利用计算机的高效性又融合了人工干预的灵活性的交互式网格生成算法，并且首次提出虚拟节点法，结合图论优化算法解决了多连通域及包含孤立边界的任意形状目标区域的网格自动生成问题。

Let α to be independence number of graph G, in 1984 Fan showed: Let G be a 2-connected graph of order n, for every pair vertices x,y of d=2, if max{d,d}≥n/2, then G is Hamiltonian.

1984年，Fan给出了著名的Fan定理：若2连通n阶图G的距离是2的任意两点x、y均有max{d，d}≥n/2，则G是哈密尔顿图。

Let G be a connected and simple graph with p order, the complement graph G is the union of a complete bipartite graph K n,m and an empty graph K.

设G为p 阶连通简单图，其补图G为完全偶图Kn，m 及空图K的并，笔者利用完全偶图的谱的特性，获得了图G的特征根分

In [29], the author gave that let G be a 2-connected graph with order n and S ≥ t, if |N ∪ N|≥ n - t for any nonadjacent vertices u and v in G, then G is pancyclic or n = 2t, G ≌ K_.

在[29]中，作者给出定理：设G是一个n阶2-连通图，且δ≥t，若对G中的任意两个不相邻的点u和v有|N∪N|≥n-t，那么G是一个泛圈图或n=2t，G≌K_。

We study the recursive structure of the twisted-cube connected network sufficiently, and prove that the twisted-cube connected network is an n regular graph with connectivity n: point out that the twisted-cube connected network is a cube-free network, which is an essential distinction with the hypercube and other variations of the hypercube; prove that the diameter of n dimensional twisted-cube connected network is [ (n+1)/2] , which is almost the half of hypercube's.

首先对其结构的递归性进行充分地研究，证明它是连通度为n的n正则图；指出扭立方体连接网络无立方体子图，这是扭立方体连接网络与超立方体及其其它变种的本质差别；证明了n维扭立方体连接网络的直径为[（n+1）/2]，它几乎是超立方体直径的一半；最后，给出超立方体及其变种的等价定义，并对它们的结构递归性、网络参数和拓扑性质等作了简单的分析、综合和比较。

Internet,much in the way that an onramp

网连通服务，就像提供一条通道把驾驶员

With Death guitarist Schuldiner adopting vocal duties, the band made a major impact on the scene.

随着死亡的吉他手Schuldiner接受主唱的职务，乐队在现实中树立了重要的影响。

But he could still end up breakfasting on Swiss-government issue muesli because all six are accused of nicking around 45 million pounds they should have paid to FIFA.

不过他最后仍有可能沦为瑞士政府&议事餐桌&上的一道早餐，因为这所有六个人都被指控把本应支付给国际足联的大约4500万英镑骗了个精光。