连通度

The issue of connectivity and boundary effect of the improved Bernoulli model are addressed, according to the requirement of direct key establishment.

给定微观个体节点的本地连通度，随机图模型是分析宏观网络的几何性质的有力工具。

It is shown that the natural connectivity can be derived mathematically from the graph spectrum as an average eigenvalue and that it changes strictly monotonically with the addition or deletion of edges.

自然连通度可以直接从网络邻接矩阵的特征谱导出，在数学形式上表示为一种特殊形式的平均特征根，并且随着加边或删边严格单调变化。

It is known that networks with greater 3 restricted edge connectivity is more reliable in certain sense.

已知在某种程度上，3限制边连通度较大的网络有较好的可靠性。

In Chapter 3,we evaluated〓-restricted edge connectivity of every con-nected circulants.

进一步，在第三章我们确定了循环图的〓限制性边连通度。

The restricted edge connectivity problem of graphs and some other graph theories are all from the study of the big network design and reliability analysis.

图的限制性边连通度问题及许多理论都是源自大型网络的设计和可靠性分析。

In this paper we investigate an important fault tolerance measure,〓restricted edge connectivity,and an impo...

本文我们研究一种重要的容错性度量〓限制性边连通度，和一类重要的可靠性度量-全部终端点的可靠性。

In this paper we investigate an important fault tolerance measure,〓restricted edge connectivity,and an important reliability measure,all terminalreliability.

本文我们研究一种重要的容错性度量〓限制性边连通度，和一类重要的可靠性度量-全部终端点的可靠性。

The super restricted edge connectivity provides a more accurate index of fault-tolerance of networks.

本文主要研究了有向de Bruijn图的限制边连通度和无向de Bruijn图的超级限制边连通性。

In this thesis, we mainly study the restricted edge connectivity for the de Bruijn digraphs and the super restricted edge connectivity for the de Bruijn undirected graphs.

并介绍了de Bruijn图和限制边连通度方面的基本概念和基本结论。

Esfahanian and Hakimiproposed the definition of restricted edge connectivity.

最近，作为容错性的度量，Esfahanian和Hakimi提出了限制性边连通度的概念。

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.

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