圈的粘连度

计算机或通信网在设计时经常考虑的问题是系统不容易被破坏,或者被破坏后是比较容易恢复的.这些要求可以用图的连通度、完整度、粘连度等参数来描叙.粘连度是一个较好的参数,因为它把网络被破坏后的最大分支的阶和分支的个数联合起来考虑.但是粘连度的计算是一个NP-完全问题,因而人们主要研究一些特殊图的粘连度.文中给出了Cn的粘连度.

The tenactity of cycles

Computer or communication networks are so designed that they do not easily get disrupted under external attack, and moreover, they are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured by various parameters like connectivity, integrity and tenacity. The tenacity is a better parameter to measure the stability of a network G, as it takes into account both the quantity and order of components of the graph.Since the problem of computing the tenacity of a generd graph is NP-Complete, it is important to determine those of special classes of graph. The tenacity of cycle is determined.