| 图的超级限制边连通性 |
| |
| 引用本文： | 欧见平,张福基.图的超级限制边连通性[J].数学学报,2004,47(5):931-940. |
| |
| 作者姓名： | 欧见平 张福基 |
| |
| 作者单位： | 1. 广东省汕头大学数学系,汕头,515063;福建省漳州师范学院数学系,漳州,363000
2. 厦门大学数学系,厦门,361005 |
| |
| 基金项目： | 国家自然科学基金(10271105,10371102)，福建省青年科技人才创新基金(2003J036)，教育厅基金(JA03147) |
| |
| 摘 要： | 在Moor-Shannon网络模型中,边连通度和限制边连通度较大的网络一般有较好的可靠性和容错性.本文证明:除两种平凡情形外,无向Kautz网络的拓扑结构,无向Kautz图UK(2,n)是超级限制边连通的.因此,它们比de Bruijn网络有更好的限制边连通性.
|
| 关 键 词： | Kautz图 网络 边连通度 |
| 文章编号： | 0583-1431(2004)05-0931-10 |
Super Restricted Edge Connectivity of Kautz Graphs |
| |
| Jian Ping OU.Super Restricted Edge Connectivity of Kautz Graphs[J].Acta Mathematica Sinica,2004,47(5):931-940. |
| |
| Authors: | Jian Ping OU |
| |
| Institution: | Jian Ping OU
(Department of Mathematics, Shantou University, Shantou 515063, P. R. China) (Department of Mathematics, Zhangzhou Normal College, Zhangzhou 363000, P. R. China)
Fu Ji ZHANG (Department of Mathematics, Xiamen University, Xiamen 361005, P. R. China) |
| |
| Abstract: | For Moor-Shannon network models, those that have greater edge connectivity and restricted edge connectivity usually have better reliability and fault-tolerance. It is proved in this paper that undirected Kautz graphs UK(d,n), the topologies of undirected Kautz networks, are super restricted edge connected except for two trivial cases. And so, they have better restricted edge connectivity than undirected De Bruijn networks. |
| |
| Keywords: | Kautz graphs Networks Edge connectivity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学学报》浏览原始摘要信息 |
| 点击此处可从《数学学报》下载免费的PDF全文 |
|
