| 无向Kautz图的超级限制边连通性 |
| |
| 引用本文： | 王世英,林上为.无向Kautz图的超级限制边连通性[J].数学研究,2006,39(4):335-344. |
| |
| 作者姓名： | 王世英 林上为 |
| |
| 作者单位： | 山西大学数学科学学院,山西,太原,030006 |
| |
| 基金项目： | This work is supported by Shanxi Province Science Foundation(20041002)and the
National Natural Science Foundation of China(10471081) |
| |
| 摘 要： | 限制边连通度作为边连通度的推广,是计算机互连网络可靠性的一个重要度量.Superλ-′是比限制边连通度更精确的一个网络可靠性指标.一个图是Superλ-′的,如果它的任一最小限制边割都孤立一条有最小边度的边.本文考虑一类重要的网络模型-无向K autz图UK(d,n)的限制边连通度λ,′证明了当d 3,n 2时,λ(′UK(d,n))=4d-4,并进一步指出此时的UK(d,n)是Superλ-′的.
|
| 关 键 词： | 无向Kautz图 限制边连通度 Superλ-′ |
| 收稿时间： | 2005-12-29 |
| 修稿时间： | 2005年12月29 |
The Super Restricted Edge Connectivity of Kautz Undirected graphs |
| |
| Wang Shiying,Lin Shangwei.The Super Restricted Edge Connectivity of Kautz Undirected graphs[J].Journal of Mathematical Study,2006,39(4):335-344. |
| |
| Authors: | Wang Shiying Lin Shangwei |
| |
| Abstract: | 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: for d≥3, n≥2,λ′(UK(d, n))=4d-4 and UK(d,n) is a super restricted edge connected graph. |
| |
| Keywords: | Kautz undirected graphs restricted edge connectivity super restricted edge connectivity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
