摘要
限制边连通度是传统边连通度的推广,而且是计算机互连网络容错性的一个重要度量.该文考虑Kautz无向图UK(3,n)的限制边连通度λ′,得到如下结果:λ′(UK(3,1))=4,n 2时,λ′(UK(3,n))=8.
The restricted edge-connectivity is a generalization of classical edge-connectivity and can provide a more accurate measure of fault-tolerance for interconnection networks.In this paper,we consider restricted edge-connectivity λ′ of Kautz undirected graph UK(3,n).We obtain the following results: λ′(UK(3,1))=4, λ′(UK(3,n))=8 for n2.
出处
《广西师范学院学报（自然科学版）》
2004年第1期36-38,共3页
Journal of Guangxi Teachers Education University(Natural Science Edition)
关键词
边连通度
限制边连通度
Kautz无向图
互连网络
edge-connectivity
restricted edge-connectivity
Kautz undirected graphs
interconnection networks
