| 圈与完全偶图的笛卡尔乘积的联结数 |
| |
| 引用本文： | 陈东灵. 圈与完全偶图的笛卡尔乘积的联结数[J]. 曲阜师范大学学报, 1988, 0(3) |
| |
| 作者姓名： | 陈东灵 |
| |
| 作者单位： | 山东矿业学院应用数学与软件工程系 |
| |
| 摘 要： | 本文给出了圈与完全偶图的笛卡尔乘积的联结数计算公式,证明了如下定理:这里S≥3,m≥2,n≥2,l=min{m,n},均为整数.
|
| 关 键 词： | 圈 完全偶图 笛卞尔乘积 联结数 |
The Binding Number of cartesian product of circuit and comprete bipartite graph |
| |
| Chen Dong ling. The Binding Number of cartesian product of circuit and comprete bipartite graph[J]. Journal of Qufu Normal University(Natural Science), 1988, 0(3) |
| |
| Authors: | Chen Dong ling |
| |
| Affiliation: | Chen Dong ling |
| |
| Abstract: | A theorem for the binding number of cartesian product of circuit and Complete bipartite graph is presented and proven in this paper. |
| |
| Keywords: | Circurt complete bipartite graph Cartesian prooluct Binding numwber |
| 本文献已被 CNKI 等数据库收录！ |
|
