| 多重路径与多重圈笛卡尔乘积图的联结数 |
| |
| 引用本文： | 王福达. 多重路径与多重圈笛卡尔乘积图的联结数[J]. 辽宁工程技术大学学报(自然科学版), 1987, 0(3) |
| |
| 作者姓名： | 王福达 |
| |
| 作者单位： | 中国煤炭经济学院 |
| |
| 摘 要： | 本文给出了多重路径与多重圈笛卡尔乘积图联结数的计算公式,并给出了证明.
|
| 关 键 词： | 偶图 联结数 平凡图 最小阶次 简单图 |
THE BINDING NUMBER OF DESCARTE'''' S MULTIPLICATING PRODUCT GRAPH OF MULTIPLE PATHS AND MULTIPLE CIRCLES |
| |
| Wang Fuda. THE BINDING NUMBER OF DESCARTE'''' S MULTIPLICATING PRODUCT GRAPH OF MULTIPLE PATHS AND MULTIPLE CIRCLES[J]. Journal of Liaoning Technical University (Natural Science Edition), 1987, 0(3) |
| |
| Authors: | Wang Fuda |
| |
| Abstract: | This paper gives a formula of calculating the binding number of Descarte's multiplicating product graph of multiple paths and multiple circles and it also gives the process of its proof. |
| |
| Keywords: | bipartite graph binding number trivial graph smallest degree simple graph |
| 本文献已被 CNKI 等数据库收录！ |
