| 完全图与完全偶图的笛卡尔乘积的联结数 |
| |
| 引用本文： | 陈东灵.完全图与完全偶图的笛卡尔乘积的联结数[J].山东科技大学学报(自然科学版),1986(4). |
| |
| 作者姓名： | 陈东灵 |
| |
| 作者单位： | 山东矿业学院应用数学与软件工程系 |
| |
| 摘 要： | 本文给出了完全图与完全偶图的笛卡尔乘积的联结数计算公式,证明了如下定理;■
|
| 关 键 词： | 完全图 完全偶图 笛卡尔乘积 联结数 最小度 同构 |
THE BINDING NUMBER OF CARTESIAN PRODUCT OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS |
| |
| Chen Dongling.THE BINDING NUMBER OF CARTESIAN PRODUCT OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS[J].Journal of Shandong Univ of Sci and Technol: Nat Sci,1986(4). |
| |
| Authors: | Chen Dongling |
| |
| Institution: | Dept. of Appl. Math. and Software Eng. |
| |
| Abstract: | A theorem for the binding number of cartesian prduct of complete graphs and complete bipartite graphs is presented and proven in this paper |
| |
| Keywords: | complete graph complete bipartite graph cartesian product binding number minimum degree isomorphism |
| 本文献已被 CNKI 等数据库收录！ |
