| 关于图P_nUC_p的匹配唯一性 |
| |
| 引用本文： | 张树生.关于图P_nUC_p的匹配唯一性[J].赣南师范学院学报,1991(Z2). |
| |
| 作者姓名： | 张树生 |
| |
| 作者单位： | 江西宁都固厚中学 |
| |
| 摘 要： | 在1]的基础上,我们证明了如下的结果:当P为奇数时,P_3UC_p是匹配唯一的。其中P_3和C_p分别表示3个点的道路和p个点的圈。
|
| 关 键 词： | 匹配 唯一性 奇数 |
ON THE MATCHING UNIQUENESS OF GRAPH PnUCp |
| |
| Zhang Shusheng Middle school of Ningdu.ON THE MATCHING UNIQUENESS OF GRAPH PnUCp[J].Journal of Gannan Teachers' College(Social Science(2)),1991(Z2). |
| |
| Authors: | Zhang Shusheng Middle school of Ningdu |
| |
| Institution: | Zhang Shusheng Middle school of Ningdu |
| |
| Abstract: | The following theorem is proved in this paper based on the result 〔1〕, -Let p be odd, the matching of graph P3UCp is unique, p3 and Cp denole the path with-three points and the cycle with P points respectively |
| |
| Keywords: | match uniqueness odd |
| 本文献已被 CNKI 等数据库收录！ |
