| 多重乘积图的联结数 |
| |
| 引用本文： | 陈东灵.多重乘积图的联结数[J].山东科技大学学报(自然科学版),1987(2). |
| |
| 作者姓名： | 陈东灵 |
| |
| 作者单位： | 山东矿业学院应用教学与软件工程系 |
| |
| 摘 要： | 本文给出并证明了完全偶图与多个圈的多重笛卡儿乘积图的一些性质及其联结数的一个计算公式。
|
| 关 键 词： | 完全偶图 圈 笛卡儿乘积 联结数 |
THE BINDING NUMBER OF MULTIPLE PRODUCT GRAPHS |
| |
| Chen Dongling.THE BINDING NUMBER OF MULTIPLE PRODUCT GRAPHS[J].Journal of Shandong Univ of Sci and Technol: Nat Sci,1987(2). |
| |
| Authors: | Chen Dongling |
| |
| Institution: | Dept. of Appl. Math. and Software Eng. |
| |
| Abstract: | Some attributes for the mubtiple cartesian product graph of complete bigraph and circuits, A theorem for the binding number of multiple cartesian product graph of complete bigraph and circuits were presented and proven in this paper |
| |
| Keywords: | complete bigraph circuit cartesian product binding number |
| 本文献已被 CNKI 等数据库收录！ |
