摘要
限制边连通度作为边连通度的推广,是计算机互连网络可靠性的一个重要度量.Superλ-′是比限制边连通度更精确的一个网络可靠性指标.一个图是Superλ-′的,如果它的任一最小限制边割都孤立一条有最小边度的边.本文考虑一类重要的网络模型-无向K autz图UK(d,n)的限制边连通度λ,′证明了当d 3,n 2时,λ(′UK(d,n))=4d-4,并进一步指出此时的UK(d,n)是Superλ-′的.
The restricted edge connectivity is a more refined network reliability index than edge connectivity. The restricted edge connectivity ^（G） of graph G is the minimum number of edges whose removal disconnects G into non-trivial components. Moreover, G is super restricted edge connected if its every minimum restricted edge cut separates exactly one edge. In this paper, we study a kind of the important model of networks-Kautz undirected graphs UK（d, n）, and show the following： ford≥3, n≥2, λ＇（UK（d, n））=4d-4 and UK（d, n） is a super restricted edge connected graph.
出处
《数学研究》
CSCD
2006年第4期335-344,共10页
Journal of Mathematical Study
基金
This work is supported by Shanxi Province Science Foundation(20041002)and theNational Natural Science Foundation of China(10471081)
关键词
无向Kautz图
限制边连通度
Super-λ'
Kautz undirected graphs
restricted edge connectivity
super restricted edge connectivity
