| 在超立方体Qn中通过给定三条边的所有圈 |
| |
| 引用本文： | 姚晓盼. 在超立方体Qn中通过给定三条边的所有圈[J]. 漳州师院学报, 2008, 0(2): 28-31 |
| |
| 作者姓名： | 姚晓盼 |
| |
| 作者单位： | [1]漳州师范学院数学与信息科学系,福建漳州363000 |
| |
| 基金项目： | 国家自然科学基金资助项目（10671191） |
| |
| 摘 要： | 本文研究了在超立方体Qn中通过给定三条边的所有圈的问题．证明了：设E0包含E（Qn）且｜E0｜=3≤n．由E0导出的子图是线性森林，则在Qn中E0的所有边包含在长为l的偶圈中，其中l是满足2n＋2≤l≤2^n的每个偶数．并且下界2n＋2是最优的．
|
| 关 键 词： | 超立方体 圈 哈密尔顿圈 嵌入 互连网络 |
Cycles Passing through Prescribed Three Edges in a Hypercube |
| |
| YAO Xiao-pan. Cycles Passing through Prescribed Three Edges in a Hypercube[J]. Journal of ZhangZhou Teachers College(Philosophy & Social Sciences), 2008, 0(2): 28-31 |
| |
| Authors: | YAO Xiao-pan |
| |
| Affiliation: | YAO Xiao-pan (Department of Mathematics and Information Science, Zhangzhou University, Fujian, Zhangzhou 363000, China) |
| |
| Abstract: | In this paper, we consider the problem of cycles passing through prescribed three edges in an n-dimensional hypercube Qn. Let E0 belong to E（Qn） and ｜ E0 ｜= 3 ≤ n. If the subgraph induced by E0 is a linear forest （pairwise dispoint paths）, then in the graph Qn three edges of E0 lie on a cycle of every even length l with 2n ＋ 2 ≤ l ≤ 2^n. And the lower bound 2n ＋ 2 is optimal. |
| |
| Keywords: | Hypercube Cycle Hamiltonian cycle Embedding Interconnection network |
| 本文献已被 维普 等数据库收录！ |
