| 无向广义De Bruijn图的m-限制边连通性 |
| |
| 引用本文： | 李积庆,欧见平.无向广义De Bruijn图的m-限制边连通性[J].五邑大学学报(自然科学版),2012,26(3):6-11. |
| |
| 作者姓名： | 李积庆 欧见平 |
| |
| 作者单位： | 五邑大学数学与计算科学学院．广东江门529020 |
| |
| 基金项目： | 国家自然科学基金资助项目 |
| |
| 摘 要： | m-限制边割将连通图G分离成阶不小于m的连通分支,图G的最小m-限制边割所含的边数称为图G的m-限制边通度,记作λm（G）.对于包含m-限制边割的连通图G,有λm（G）≤ξm（G）（m≤3）;如果λm（G）=ξm（G）,则称图G是极大m-限制边连通的.本文证明：当n≥7时,无向广义De Bruijn图UBG（2,n）是极大m-限制边连通的（m={2,3}）.
|
| 关 键 词： | 广义DeBruijn图 边割 限制边连通度 |
The m-restricted Edge Connectivity of Undirected Generalized De Bruijn Graphs |
| |
| LI Ji-qing,OU Jian-ping.The m-restricted Edge Connectivity of Undirected Generalized De Bruijn Graphs[J].Journal of Wuyi University(Natural Science Edition),2012,26(3):6-11. |
| |
| Authors: | LI Ji-qing OU Jian-ping |
| |
| Institution: | (School of Mathematics and Computation Science,Wuyi University,Jiangmen 529020,China) |
| |
| Abstract: | An m-restricted edge cut is an edge cut of a connected graph that disconnects this graph into each components having order at least m.The minimum size m-restricted edge cut of graph G is m-restricted edge connectivity,denoted by λm(G).It is known that λm(G) ≤ ξm(G) holds for graph G that contain m-restricted edge cut whenever m ≤ 3.Graph G is maximally m- restricted edge connected if λm(G)=ξ m(G).In this paper,for some m = { 2,3},undirected generalized De Bruijn graphs UBG(2,n) are proved to be maximally m-restricted edge connected whenever n ≥ 7. |
| |
| Keywords: | generalized De Bruijn graphs edge cut restricted edge connectivity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
