摘要
在[2][3][4]的基础上,我们证明了如下的定理:若n,n_1,n_2均是偶数,p≥3且p≠n+1,r或是不等于4的偶数或是质数,则下列图类(ⅰ)P_nUC_p(ⅱ)P_3UC_r(ⅲ)P_(n1)UP_(n2)(ⅳ)P_3UP_n均是匹配唯一的,其中P_i和C_j分别表示有i个点的道路和j个点的圈。
The following theorem be proved in this paper by applying the results of [2] [3] and[4]: Let n,n_1 and n_2 be all even, r be (?) prime or an even which does not equal to 4, Then the following graph families are all matching unique: (1) P_n ∪C_p(2)P_3 ∪C_r (3)P_(n1) ∪P_(n2)(4)P_3∪P_n, where P_i and C_j denote the path with i points and the cycle with j points respectively.
出处
《应用数学》
CSCD
北大核心
1989年第2期25-30,共6页
Mathematica Applicata
