| 2n-正则简单图的边连通度 |
| |
| 引用本文： | 盛集明.2n-正则简单图的边连通度[J].数学的实践与认识,2010,40(1). |
| |
| 作者姓名： | 盛集明 |
| |
| 作者单位： | 荆楚理工学院,数理学院,荆门,448000 |
| |
| 基金项目： | 湖北省教育厅重点科研项目(D20083501); 荆楚理工学院科学研究项目(ZR200603) |
| |
| 摘 要： | 图的各种连通度概念被先后用来研究网络可靠性问题.对于0到2n之间的任意一个偶数2m,构造了一个2n-正则简单图,使得其边连通度的值为2m.从而得到:2n-正则简单图的边连通度能够取{0,2,4,…,2n}中的任何一个偶数.
|
| 关 键 词： | 边连通度 正则图 |
The Edge-Connectivity of 2n-Regular Simple Graph |
| |
| SHENG Ji-ming.The Edge-Connectivity of 2n-Regular Simple Graph[J].Mathematics in Practice and Theory,2010,40(1). |
| |
| Authors: | SHENG Ji-ming |
| |
| Institution: | SHENG Ji-ming(Mathematics Department,Jingchu Institute of Technology,Jingmen 448000,China) |
| |
| Abstract: | All kind of conceptions on connectivity of graph have been used to study the reliability problem of networks.Let 2m be an even number in .We construct a 2n-regular simple graph such that the value of it′s edge-connectivity is 2m.It shows that the edge-connectivity of 2n-regular simple graph can be any even number of {0,2,4,…,2n}. |
| |
| Keywords: | edge-connectivity regular graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
