| 两个完全图的乘积的树宽 |
| |
| 引用本文： | 原晋江,罗来兴.两个完全图的乘积的树宽[J].运筹学学报,2004,8(1):62-68. |
| |
| 作者姓名： | 原晋江 罗来兴 |
| |
| 作者单位： | 郑州大学数学系,郑州,450052 |
| |
| 基金项目： | Research supported by the Natural Science Foundation of Henan Province，the Huo Ying Dong Education Foundation of China. |
| |
| 摘 要： | 本文确定了乘积图Km×Kn的树宽.我们的结果是若m和n都是偶数,且m≥n,或m是奇数而n是偶数,或m和n都是奇数且n≥m,则Km×Kn的树宽是TW(Km×Kn)=n(m+1)/2-1.这恰好是图Km×Kn的带宽.
|
| 关 键 词： | 完全图 树宽 乘积图 带宽 |
Treewidth of the Product of Two Complete Graphs |
| |
| Abstract.Treewidth of the Product of Two Complete Graphs[J].OR Transactions,2004,8(1):62-68. |
| |
| Authors: | Abstract |
| |
| Abstract: | We determine in this paper the treewidth of Km × Kn. Our result is that: If both m and n are even and m ＞ n, or m is odd and n is even, or both m and n are odd and n ＞ m, then the treewidth of Km × Kn isTW(Km × Kn) = n(m + 1/2)-1.This is exactly the bandwidth of Km × Kn. |
| |
| Keywords: | OR treewidth bandwidth product graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
