边连通度

The connectivity and edge connectivity axe important measure of the network's reliability.

连通度和边连通度是衡量网络可靠性的一个重要参数。

The connectivity and edge connectivity axe important measure of the networks reliability.

连通度和边连通度是衡量网络可靠性的一个重要参数。

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.

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

Let G be a connected graph of order n whose algebraic connectivity, vertex connectivity, and edge connectivity are α,κ, and λ, respectively.

n阶连通图G的代数连通度、点连通度和边连通度分别记作α，κ和λ。

In fact, on one hand, it is often found that two graphs with the same number of verticesand the same connectivity(edge-connectivity) may result in entirely different forms after a minimum disconnecting set of vertices 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.On the other hand, we often face this question: how easily can we disrupt a system at the least cost, on the contrary, when we set up a system, especially a communication system, we try our best to make it as stable as possible that it can be reconstructed easily if it do get disrupted .

对于两个具有相同点数，具有相同点连通度的图，从图中分别去掉使图不连通的点集后，所得图的结构可能完全不同，这是因为点连通度、边连通度和局部点、边连通度等连通性参数仅反映了系统被破坏的难易程度，而对系统遭受破坏的程度并没有明确的反映。

Let G be an undirected, simple and connected graph.

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

In the project, we found a method for designing a family of 4-optimal double loop networks, established some sharp upper bounds of forwarding indices, distance domination nember, the edge-connectivity and the sharp upper bounds of wide-diameter and fault-tolerant diameter of Cartesian product graphs, the lower bounds of restricted edge-connectivity of digraphs and a sufficient and necessary condition for the restricted edge-connectivity of a graph to be equal to the restricted connectivity of its line graphs; raveled pancyclicity and panconnectivity and obtained the exact values of the mentioned parameters for some well-known networks.

本项目给出最优双环网络的设计方法，找到4紧优双环网络无限族，建立了路由转发指数紧的界，确定了笛卡尔乘积图的边连通度的表达式，宽直径和容错直径紧的上界，给出有向图限制边连通度的下界和无向图的限制边连通度等于它的线图限制点连通度的充要条件，对一些著名的网络确定了上述参数的精确值，讨论了宽直径和容错直径之间的关系，解决了超立方体某些变型网络的泛圈性和泛连通性，得到距离控制数的紧的上界。

This one mode pays close attention to network credence foundation of the businessman very much.

这一模式非常关注商人的网络信用基础。

Cell morphology of bacterial ghost of Pasteurella multocida was observed by scanning electron microscopy and inactivation ratio was estimated by CFU analysi.

扫描电镜观察多杀性巴氏杆菌细菌幽灵和菌落形成单位评价遗传灭活率。