连通度

In the last, we give a new upper bound of the algebraic connectivity about the dominate number.

最后给出了图的代数连通度关于独立数的一个新的上界。

Based on these researches, according to the new requests of county highway network planning and construct that caused by New Socialist Countryside Construction, thesis takes some new research on the basis of analysing the conventional country highway network planning methods, improves the veracity of crunodes by using amendatory crunode important degree model, then founds county highway network planning layout and grade optimization model to improve the scientific of highway network planning, it also gives an evaluative of county highway network by using network power fuzzy connectivity method.

基于上述研究，结合社会主义新农村建设对县乡公路网规划建设的新要求，文章在对传统县乡公路网规划方法分析的基础上对其进行了新的探索，运用改进的结点重要度模型提高了结点选择的准确性，进而通过建立县乡公路网规划布局和等级优化模型而提高了县乡公路网规划的科学性，并应用路网加权模糊连通度评价方法对县乡公路网规划进行评价。

We know that edge connectivity plays an importent role in the connectivity of graph.

我们知道，边连通度是反映图的连通性质的一个重要参数。

The restricted edge connectivity is a more refined network reliability index than edge connectivity.

限制边连通度作为边连通度的推广，是计算机互连网络可靠性的一个重要度量。

But there are few results on the restricted edge connectivity of de Bruijn digraphs.

在本文第二章我们计算了有向de Bruijn图的限制边连通度，给出：当d≥3，n≥2或d=2，n≥3时，有向de Bruijn图B的限制边连通度为(2d-2)。

The restricted edge connectivity λ of X is the minimum number of edges whose removal disconnects X into nontrivial components.

图X的满足去掉它后每个连通分支都至少有两个点的边割的最小基数称为图X的限制边连通度。

In our living ,the restricted edge connectivity problem has a big application, and with the development of the field some scholars presented and studied a few restricted edge connectivity problems with different restrictions.

另外限制性边连通度在实际问题中有着广泛的应用，是图论研究中一个很活跃的课题，各类限制边连通度问题被相继提出并加以发展、应用。

In [2], Kirkland characterizes the limit points for algebraic connectivity of trees in terms of Perron values of certain positive matrices, and finds the four largest elements of limit points for algebraic connectivity of trees together with the corresponding branches.

Kirkland在文献[2]中用正矩阵Perron值的方法刻划了树的代数连通度的极限点，并给出了树的代数连通度的前四大值和达到这些数值相应的分支。

The theory of graphs and relations between the spectra and fixed variate (e.g. chromatic number, degree sequence, diameter and connectivity) of graphs by means of the well-developed theory and technique of algebra, topological structure properties of graph, combination and matrix theories so as to establish firm essential relation between the algebraic properties and topological properties of graphs and networks.

图谱理论的研究主要是利用成熟的代数理论和技巧，并结合图的拓扑结构性质和组合数学的理论、矩阵理论来研究图谱及其与图的结构性质、图的其它不变量(如色数，度序列，直径，连通度等)之间的关系，将图与网络的代数性质与图的拓扑性质紧密地联系在—起。

Let G be an undirected, simple and connected graph.

最小限制边割所含的边数称为G的限制边连通度(有向图的限制边连通度可类似给出)。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。