| 无向二元De Bruijn图的边割计数 |
| |
| 引用本文： | 欧见平.无向二元De Bruijn图的边割计数[J].内蒙古师范大学学报(自然科学版),2004,33(1):17-21. |
| |
| 作者姓名： | 欧见平 |
| |
| 作者单位： | 漳州师范学院数学系,福建漳州363000 |
| |
| 基金项目： | ProjectSupportedbytheNationalNaturalScienceFoundationofChina(10 2 7110 5 )，FoundationofEducationMinistryof
Fujian(AJ0 3 14 7) |
| |
| 摘 要： | 利用无向二元De Bruijn图UB(2，n)的极大限制边连通性计算了它的边割数，确定了阶至多为3的边割数，同时，给出了4阶边割数的一个上界，认为此上界是紧的。
|
| 关 键 词： | 无向二元De Bruijn图 连通性 边割 上界 |
Counting Edge Cuts of Undirected Binary De Bruijn Graphs |
| |
| Abstract.Counting Edge Cuts of Undirected Binary De Bruijn Graphs[J].Journal of Inner Mongolia Normal University(Natural Science Edition),2004,33(1):17-21. |
| |
| Authors: | Abstract |
| |
| Abstract: | Employing the maximal restricted edge connectivity of undirected binary de Bruijn graph UB(2,n) ,we enumerate its edge cuts and determine the number of edge cuts that have size at most three. An upper bound on the number of edge cuts of size four are also presented,which we believe is sharp. |
| |
| Keywords: | De Bruijn graph connectivity edge cut |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
